#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

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

typedef vector<short int> bigint;
typedef unsigned int uint;

const uint B = 10; ///baza in care lucram

istream &operator >> (istream &f, bigint &x) {
    x.clear();
    string s;
    f >> s;
    uint n = s.length();
    for (uint i = 0; i < n; i++)
        x.push_back(s[i] - '0');
    return f;
}

ostream &operator << (ostream &g, const bigint &x) {
    uint n = x.size();
    for (uint i = 0; i < n; i++)
        g << x[i];
    return g;
}

bool operator < (const bigint &a, const bigint &b) {
    if (a.size() == b.size())
        return lexicographical_compare(a.begin(), a.end(), b.begin(), b.end());
    else return a.size() < b.size();
}

void inm_scalar(bigint &x, int val) {
    short T = 0;
    for (int i = x.size() - 1 ; i >= 0 ; --i) {
      //  cerr<<i<<"\n";
        x[i] = (x[i] * val) + T;
        T = (x[i] / 10);
        x[i] %= 10;
    }
    while (T) {
        x.insert(x.begin(), 1u, T % 10);
        T /= 10;
    }
}

bigint sol;

int main() {
    int n;
    fin >> n;

    sol.clear();
    sol.push_back(1);
    for (int i = 2 ; i <= n ; ++i)
        inm_scalar(sol, i);
    for (int i = 1 ; i <= n ; ++i)
        inm_scalar(sol, 2);
    for (int i = 1 ; i <= (n * n) - n ; ++i)
        inm_scalar(sol, 2);

    fout << sol << "\n";
    return 0;
}