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

int main() {
  int l;
  cin >> l;
  ll ans = 1;
  for (int i = 1; i <= 11; i++) {
    ans*= l - i;
    ans/= i;
  }
  cout << ans << endl;
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
//constexpr ll MOD = 1e9 + 7;
constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll L;
  cin >> L;

  const ll M = 210;
  vector<vector<ll>> C(M, vector<ll>(M, 0));
  C.at(0).at(0) = 1;
  for (ll i = 0; i < M - 1; i++)
  {
    for (ll j = 0; j < i + 1; j++)
    {
      C.at(i + 1).at(j) += C.at(i).at(j);
      C.at(i + 1).at(j + 1) += C.at(i).at(j);
    }
  }

  /*
  for (ll i = 0; i < M; i++)
  {
    for (ll j = 0; j < M; j++)
    {
      cerr << C.at(i).at(j) << " ";
    }
    cerr << endl;
  }
  //*/

  ll ans = C.at(L - 1).at(11);
  cout << ans << endl;
}