#include <bits/stdc++.h>
using namespace std;

#define co(n) cout<<n<<endl;
const double eps=1e-10,pi=3.1415926535898;
const int mod=1e9+7,maxn=410;
int T,n,m,k,x,y;
long long dp[maxn][maxn];

void init() {
	for (int i=0;i<maxn;++i) {
		dp[i][0] = dp[i][i] = 1;
	}
	for (int i=2;i<maxn;++i) {
		for (int j=1;j<i;++j) {
			dp[i][j] = dp[i-1][j]+dp[i-1][j-1];
		}
	}
}

int main(int argc, char const *argv[]) {
	init();
	T = 1;
	//scanf("%d", &T);
	for (int _=1;_<=T;++_) {
		long long ans=0;
		scanf("%d", &n);
		printf("%lld\n", dp[n-1][11]);
	}
	return 0;
}

/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
clock_t clk;
clk = clock();
if(clock() - clk > CLOCKS_PER_SEC * 0.9) 
      T
W     L
A C M E R
  E L   E
    E
*/
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;   typedef pair<int,int>pint;
using vll=vector<ll>;   using vs=vector<string>;
#define b2e(v)v.begin(),v.end()
#define p2a(v, p) v[p.first][p.second]

class var { public: ll min,max,ct,sum,dif,result; };
int main() {
    const ll cut=11;
    ll l; cin>>l;

    ll val, sum = 1;
    for (ll i = 1; i <= cut; i++) {
        sum *= l-i;
        sum /= i;
    }
    cout << sum << endl;
}
