#include <cstdio>
#include <algorithm>

using namespace std;

int ans[1000005];

void mult(int x){
    int i,T;
    T = 0;
    for(i = 1;i <= ans[0];i++){
        ans[i] *= x;
        ans[i] += T;
        T = ans[i]/10;
        ans[i] %= 10;
    }
    while(T){
        ans[++ans[0]] = T%10;
        T /= 10;
    }
}

int main(){
    freopen("patrate2.in", "r", stdin);
    freopen("patrate2.out", "w", stdout);
    int i,n;
    ans[0] = 1;
    ans[1] = 1;
    scanf("%d", &n);
    n = n*(3*n-1)/2;
    for(i = 1;i <= n;i++){
        mult(2);
    }
    for(i = ans[0];i >= 1;i--){
        printf("%d",ans[i]);
    }
    return 0;
}