#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<algorithm>

using namespace std;
using ll = long long;
using ld = long double;

int main(){
  ll l;
  cin >> l;
  ld prod = 1;

  for(int i=1;i <= 11;i++){
    if(i == l-11) break;
    prod *= (l-i);
    prod /= i;
  }
  ll ans = (ll)prod;
  cout << ans << endl;
  return 0;
}
/******************************
Author: jhnah917(Justice_Hui)
g++ -std=c++14 -DLOCAL
******************************/

#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;

typedef long long ll;

int N;
ll D[222][222];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N;
    D[0][0] = 1;
    for(int i=1; i<=N; i++) D[i][0] = 1;
    for(int i=1; i<=N; i++){
        for(int j=1; j<=i; j++) D[i][j] = D[i-1][j] + D[i-1][j-1];
    }
    cout << D[N-1][11];
}