
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <vector>

using namespace std;

int main() {

   int l;
   scanf("%d", &l);

   // Answer is C(l - 1, 11)
   long long ans = 1;
   for (int i = 1; i <= 11; i++) {
      ans *= l - i;
      ans /= i;
   }
   printf("%lld\n", ans);

   return 0;
}


#include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>

using namespace std;
using ll = long long;

int l;

ll dp[201][201];

ll memo(int idx, int leng);

int main()
{
    memset(dp, -1, sizeof dp);
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> l;
    cout << memo(0, 0);
}

ll memo(int idx, int leng)
{
    if (idx == 11)
    {
        if (leng < l)
            return 1;
        else
            return 0;
    }

    ll &ret = dp[idx][leng];

    if (ret != -1)
        return ret;
    ret = 0;

    for (int i = leng + 1; i < l; ++i)
        ret += memo(idx + 1, i);

    return ret;
}