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

typedef long long LL;
#define int LL
const int N = 300;
int c[N][N];
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  c[0][0] = 1;
  for (int i = 1; i < N; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      c[i][j] = c[i - 1][j]+ c[i - 1][j - 1];
    }
  }
  
  int n;
  cin >> n;
  cout << c[n - 1][11] << endl;
  return 0;
}


#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
using namespace std; 
 using ll = long long;
void solve(ll n, ll r)
{

	long long p = 1, k = 1;

	if (n - r < r)
		r = n - r;

	if (r != 0) {
		while (r) {
			p *= n;
			k *= r;

			long long m = __gcd(p, k);
			p /= m;
			k /= m;

			n--;
			r--;
		}
	}

	else
		p = 1;

	cout << p << endl;
}

signed main()
{
	ll n;
	cin >> n;
	n--;

	solve(n, 11);

	return 0;
}

// ll fact(ll n); 
  
// ll nCr(ll n, ll r) 
// { 
// 	cout << fact(n) << " " << fact(r) << " ";
//     return fact(n) / (fact(r) * fact(n - r)); 
// } 
  
// ll fact(ll n) 
// { 
//     ll res = 1; 
//     for (ll i = 2; i <= n; i++) 
//         res = res * i; 
//     return res; 
// } 
  
// ll main() 
// { 
//     ll n,r;
//     cin >> n;
//     n--;
//     cout << nCr(n,11); 
//     return 0; 
// } 