#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define rep1(i,n) for(int i=1; i<(int)n; i++)
#define COUT(x) cout<<(x)<<endl
using vi = vector<int>;
using vvi = vector<vi>;
const int mod = 1e9+7;

int modPow(int a, int n) {
  if (n == 0) return 1; // 0乗にも対応する場合
  if (n == 1) return a % mod;
  if (n % 2 == 1) return (a * modPow(a, n - 1)) % mod;
  int t = modPow(a, n / 2);
  return (t * t) % mod;
}

signed main(){
    int L; cin >> L; L--;
    int N = L; 
    int K = 11;

    vi comb(N+1);
    comb[0]=1;
    rep1(i,K+1){
        comb[i] = (comb[i-1]*(N-i+1)/i);
    }
    cout << comb[K] << endl;
    return 0;
}
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>
#include <omp.h>
#include <string.h>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;
typedef pair<long long int, pll> lpll;

bool overflow_checker(long long int input_number1,long long int input_number2){
    if(5000000000000000000/input_number1<input_number2){
        return true;
    }else{
        return false;
    }
}

const long long int mod = 998244353;
const long long int INF = 2e18;
const long double PI=3.14159265358979323; 
const long long int pl=1100;
const long double eps =0.00001;


long long int N,A[200200],B[200200],C;
long long int dp[402][402]={};

string S;
long long int mymin=INF,num=INF;
int main(){

    cout << fixed << setprecision(18);
    cin>>N;
    for (long long int i = 1; i < 300; i++)
    {
        dp[i][0]=1;
        dp[i][i]=1;
        for (long long int j = 1; j < i; j++)
        {
            dp[i][j]=dp[i-1][j]+dp[i-1][j-1];
        }
        
    }
    cout<<dp[N-1][11]<<endl;
    
    
}
