// p = (1*2*3*..*n) * (2^(n*n))

#include <fstream>
 
using namespace std;

ifstream fin("patrate2.in");
ofstream fout("patrate2.out");

void inmultire(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;
}
 
int n, p[10110];
 
int main() {
    fin >> n;
    fin.close();
    p[0] = p[1] = 1;
    for(int i = 1; i <= n; i++) {
        inmultire(p, i);
    }
    for(int i = 1; i <= n * n; i++) {
        inmultire(p, 2);
    }
    for(int i = p[0]; i >= 1; i--) {
        fout << p[i];
    }
    return 0;
}