#include <iostream>


const int maxn = 1000000;

FILE *in = fopen("patrate2.in","r"), *out = fopen("patrate2.out","w");

int N;
int H[maxn];
int B[10];

void mul(int A[], int B)
{
    int i, t = 0;
    for (i = 1; i <= A[0] || t; i++, t /= 10)
        A[i] = (t += A[i] * B) % 10;
    A[0] = i - 1;
}

void mulmare(int A[], int B[])
{
    int i, j, t, C[maxn];
    memset(C, 0, sizeof(C));
    for (i = 1; i <= A[0]; i++)
    {
        for (t=0, j=1; j <= B[0] || t; j++, t/=10)
            C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
        if (i + j - 2 > C[0]) C[0] = i + j - 2;
    }
    memcpy(A, C, sizeof(C));
}

int main()
{
    fscanf(in, "%d", &N);

    int t = N;

    if ( t >= 10 )
    {
        int cnt = 0;
        while ( t )
        {
            B[++cnt] = t % 10;
            t /= 10;
        }
        B[0] = cnt;
    }

    H[0] = 1;
    H[1] = 2;

    int end = N*N;

    for ( int i = 1; i < end; ++i )
        mul(H, 2);

    if ( N < 10 )
        mul(H, N);
    else
        mulmare(H, B);


    for ( int i = H[0]; i; --i )
        fprintf(out, "%d", H[i]);

	return 0;
}