#include <stdio.h>
 
// Fungsi rekursif untuk menghitung suku ke-n
int deret(int n) {
    if (n == 1)
        return 1; // basis
    else
        return deret(n - 1) + (n + 1) * (n + 1); // rekursi
}
 
int main() {
    int n;
    scanf("%d", &n); // input nilai n
 
    // batasan 1 ≤ n ≤ 10
    if (n < 1 || n > 10) {
        printf("Input di luar batas!\n");
        return 0;
    }
 
    printf("%d\n", deret(n)); // output hasil
 
    return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyBGdW5nc2kgcmVrdXJzaWYgdW50dWsgbWVuZ2hpdHVuZyBzdWt1IGtlLW4KaW50IGRlcmV0KGludCBuKSB7CiAgICBpZiAobiA9PSAxKQogICAgICAgIHJldHVybiAxOyAvLyBiYXNpcwogICAgZWxzZQogICAgICAgIHJldHVybiBkZXJldChuIC0gMSkgKyAobiArIDEpICogKG4gKyAxKTsgLy8gcmVrdXJzaQp9CgppbnQgbWFpbigpIHsKICAgIGludCBuOwogICAgc2NhbmYoIiVkIiwgJm4pOyAvLyBpbnB1dCBuaWxhaSBuCgogICAgLy8gYmF0YXNhbiAxIOKJpCBuIOKJpCAxMAogICAgaWYgKG4gPCAxIHx8IG4gPiAxMCkgewogICAgICAgIHByaW50ZigiSW5wdXQgZGkgbHVhciBiYXRhcyFcbiIpOwogICAgICAgIHJldHVybiAwOwogICAgfQoKICAgIHByaW50ZigiJWRcbiIsIGRlcmV0KG4pKTsgLy8gb3V0cHV0IGhhc2lsCgogICAgcmV0dXJuIDA7Cn0K

Mg==

2