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

int main()
{
    int L;
    cin >> L;
    unordered_map<int, int> mp;
    for (int i = 0; i < 11; i++) {
        int n = L - 12 + 11 - i;
        for (int k = 2; k * k <= n; k++) {
            while (n % k == 0) {
                mp[k]++;
                n /= k;
            }
        }
        if (n != 1) mp[n]++;
    }
    mp[2] -= 8;
    mp[3] -= 4;
    mp[5] -= 2;
    mp[7] -= 1;
    mp[11] -= 1;
    long long ans = 1;
    for (auto kv : mp) {
        while (kv.second) {
            ans *= kv.first;
            kv.second--;
        }
    }
    cout << ans << endl;
}
#include <iostream>
using namespace std;

const int N = 300, R = 20;
long long com[N][R];

long long combi(int n, int r) {
    if(com[n][r]!=0) return com[n][r];
    if(n==r) return com[n][r] = 1;
    if(r==0) return com[n][r] = 1;
    return com[n][r] = combi(n-1,r) + combi(n-1,r-1);
}

int main() {
    int l;
    cin>>l;
    long long ans;
    ans = combi(l-1,11);
    cout<<ans<<endl;
    return 0;
}