#include <iostream>
using namespace std;
int main() {

    long long n;
    cin >> n;
    long long ans[n];

    ans[0] = 1;

    for(int i=1;i<n;i++) {

        ans[i] = ans[i-1] * (n-i) / i;
    }

    /*for(int i=0;i<n;i++) {

        cout << ans[i] << " ";
    }
    cout << endl;*/
  
  	cout << ans[11] << endl;
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph=vector<vector<int>>;
const long long INF = 1ll << 60;

std::vector<std::vector<long long>> comb(int n, int r) {
  std::vector<std::vector<long long>> v(n + 1,std::vector<long long>(n + 1, 0));
  for (int i = 0; i < v.size(); i++) {
    v[i][0] = 1;
    v[i][i] = 1;
  }
  for (int j = 1; j < v.size(); j++) {
    for (int k = 1; k < j; k++) {
      v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]);
    }
  }
  return v;
}

int main(){
	ll l;
	cin>>l;
	vector<vector<ll>> ans=comb(l,12);
	cout<<ans[l-1][11]<<endl;
	return 0;
}