#include <bits/stdc++.h>

using namespace std;
#define ms(x,a) memset(x,a,sizeof x)
typedef long long ll;
const int mod=1e9+7, seed=131, MAXN=0;

bool vis[12];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    ll l, ans=1; cin >> l;
    for (int i=l-1;i>=l-11;--i){
        ans*=i;
        for (int j=1;j<=11;++j){
            if (vis[j]) continue;
            if (ans%j==0) vis[j]=1, ans/=j;
        }
    }
    cout << (ll)ans << '\n';
}
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff(i,n) for(i=0;i<n;i++)
#define pb push_back 
#define mp make_pair
int main() {
    ll t;
    t = 1;
    while(t--){
  	    ll l,i,j;
  	    cin>>l;
  	    ll dp[201][12];
  	    for(i=0;i<200;i++)
  	    	dp[i][0] = 1;
  	    for(i=0;i<201;i++){
  	    	for(j=1;j<12;j++){
  	    		if(i>j)
  	    			dp[i][j] = dp[i-1][j] + dp[i-1][j-1];
  	    		else if (i==j)
				  	dp[i][j] = 1;
				else
					dp[i][j] = 0;	  	
			}	
		}	
		cout<<dp[l-1][11];
	}
   	return 0; 
}