#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("patrate2.in");
ofstream out("patrate2.out");
const int maxn = 10005;
int v[maxn];
void mult(int x)
{
    int tr = 0;
    int i = 0;
    for(i = 1; i <= v[0] || tr > 0; i++)
    {
        v[i] = (tr += v[i] * x) % 10;
        tr = tr / 10;
    }
    v[0] = i - 1;
}

int main()
{
    int n;
    in >> n;
    v[0] = v[1] = 1;
    for(int i = 1; i <= n * n; i++)
        mult(2);
    for(int i = 1; i <= n; i++)
        mult(i);
    reverse(v + 1, v + v[0] + 1);
    for(int i = 1; i <= v[0]; i++)
        out << v[i];
    out << "\n";
    return 0;
}