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

#define all(s) s.begin(), s.end()
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
#define bit(x, y) ((x >> y) & 1)

long long C(int n, int k) {
    long long res = 1;
    for (int i = 0; i < k; i++) {
        res *= (n - i);
        res /= (i + 1);
    }
    return res;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); 
    cout.tie(0);

    int l;
    cin >> l;
    
    cout << C(l - 1, 11) << '\n';

    return 0;
}
#include<iostream>
#include<bits/stdc++.h>
using namespace std;

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define merge(a,b) a##b 
#define mkstr(a) #a  
#define flush fflush(stdout);
#define debug(x,y) cout<<#x<<" "<<y<<endl;

typedef long long ll;
typedef long double   ld;
typedef unsigned long long ull;

const long long mod=1e9+7;
const long long inf=1e18;

/************************************TEMPLATE**********************************/

ll modpower(ll x,ll y)
{
  ll res=1;
  x=x%mod;
  if(x==0) return 0;
  while(y>0)
  {
    if(y&1)
      res=(res*x)%mod;
    y=y>>1;
    x=(x*x)%mod;
  }
  return res;
}
/*************************************CODE*************************************/

int main()
{
  fastIO
  ll test_case=1;
  // cin>>test_case;
  while(test_case--)  {
    int x;
    cin>>x;
    if(x<0)  {
      x=0;
    }
    cout<<x<<endl;
  }
  return 0;
}
