#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll l,dp[N][14];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>l;
	dp[0][0]=1;
	REP1(i,l){
		REP1(k,12){
			REP(j,i){
				dp[i][k]+=dp[j][k-1];
			}
		}
	}
	cout<<dp[l][12]<<"\n";
	return 0;
}


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

template <class A, class B> bool cmin(A& a, B b) { return a > b && (a = b, true); }
template <class A, class B> bool cmax(A& a, B b) { return a < b && (a = b, true); }

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int L;
  cin >> L;

  vector<vector<long>> ncr;
  auto pas = [&](auto n) {
    if (n < (int)ncr.size()) return;
    ncr.resize(n + 1, vector<long>(n + 1));
    ncr.at(0).at(0) = 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j <= i; j++) {
        ncr.at(i).at(j) += ncr.at(i - 1).at(j);
        if (j) ncr.at(i).at(j) += ncr.at(i - 1).at(j - 1);
      }
    }
  };
  pas(1000);

  cout << ncr.at(L - 12 + 11).at(11) << '\n';
}