#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<ll, ll> pll;

#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)

const ll MOD = 1000000007;
const ll INF = (ll) 1e15;

ll cmb(ll L) {
    ll p = L;
    ll n = 11;
    ll ret = 1;
    REP(_, 11) {
        ret *= p;
        p--;
        while (n > 0 && ret % n == 0) {
            ret /= n;
            n--;
        }
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll L;
    cin >> L;
    ll ans = 1;

    cout << cmb(L - 1) << endl;

    return 0;
}
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
unsigned long long int binomialCoeff(int n, int k) 
{ 
    unsigned long long int C[n + 1][k + 1]; 
    int i, j; 
  
    // Caculate value of Binomial Coefficient 
    // in bottom up manner 
    for (i = 0; i <= n; i++) 
    { 
        for (j = 0; j <= min(i, k); j++) 
        { 
            // Base Cases 
            if (j == 0 || j == i) 
                C[i][j] = 1; 
  
            // Calculate value using previously 
            // stored values 
            else
                C[i][j] = C[i - 1][j - 1] + 
                          C[i - 1][j]; 
        } 
    } 
  
    return C[n][k]; 
}  
int main()
{
    int l;
    cin>>l;
    cout<<binomialCoeff(l-1,11)<<endl;
    return 0;
}