#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OJ \
    freopen("swap.in", "r", stdin); \
    freopen("swap.out", "w", stdout);
void no(){
    cout<<"No";
    exit(0);
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);
ll n;
ll k=11;
cin>>n;
//n+11Cn but this will include 0 solution also
 ll n1=n-1;
 if(n1==k) {
     cout<<1;
     return 0;
 }
        ll r=k;
        ll res=1;
        if(n1-k<k){
            r=n1-k;
        }
        for(int i=1;i<=r;i++){
            res=res*(n-i)/i;
        }
        cout<<res<<"\n";
}










#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;

int main() {
  int x;
  cin >> x;
  if(x >= 0) cout << x << endl;
  else cout << 0 << endl;
  return 0;
}