func_code_string: #include <bits/stdc++.h>   using namespace std;   long long mod = 1e9 + 7;   long long po(long long x, long long y, long long p) {     long long res = 1;     x = x % p;     if (x == 0) return 0;     while (y > 0) {       if (y & 1) res = (res * x) % p;       y = y >> 1;       x = (x * x) % p;     }     return res;   }   long long gcd(long long a, long long b) {     if (b == 0) return a;     return gcd(b, a % b);   }   int countP(int n, int k) {     if (n == 0 || k == 0 || k > n) return 0;     if (k == 1 || k == n) return 1;     return k * countP(n - 1, k) + countP(n - 1, k - 1);   }   void solve() {     long long fac = 1;     long long n;     cin >> n;     long long xo = n;     if (n == 2)       cout << 1 <<   n ;     else {       for (long long i = 1; i <= n; i++) {         fac = fac * i;       }       fac *= 2;       fac /= n;       fac /= n;       cout << fac <<   n ;     }   }   int main() {     ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);     int t = 1;     while (t--) {       solve();     }     return 0;   }   