#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=20,M=210;
int l;
ll dp[N][M];
ll dfs(int p,int s){
    if(s>l) return 0;
    if(p==13){
        if(s==l) return 1;
        return 0;
    }
    if(dp[p][s]!=-1) return dp[p][s];
    ll ans=0;
    ans+=dfs(p,s+1);
    ans+=dfs(p+1,s+1);
    return dp[p][s]=ans;
}
int main(){
    cin>>l;
    memset(dp,-1,sizeof(dp));
    cout<<dfs(1,0)<<endl;
}
#include "bits/stdc++.h"
using namespace std;
#define endl "\n"
using ll = long long;
const int MOD = 1e9 + 7;

ll binomialCoeff(ll n, ll k)
{
	ll res = 1;

	// Since C(n, k) = C(n, n-k)
	if (k > n - k)
		k = n - k;

	// Calculate value of
	// [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
	for (ll i = 0; i < k; ++i) {
		res *= (n - i);
		res /= (i + 1);
	}

	return res;
}

void solve() {
	ll num; cin >> num;
	cout << binomialCoeff(num - 1, 11) << endl;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int t = 1;
	// cin >> t;
	while (t--) {
		solve();
	}
}