#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 998244353;
const ll INF = 1e16;


const ll MAXN = 210;
const ll MAXR = 10;

ll C[MAXN][MAXR];
 
ll Comb(ll n, ll r) {
       if(n == r) {
           return C[n][r] = 1;
       } 
       if(r == 0) {
           return C[n][r] = 1;
       } 
       if(r == 1) {
           return C[n][r] = n;
       } 
       if(C[n][r]) {
           return C[n][r];
       } 
       return C[n][r] = Comb(n-1, r) + Comb(n-1, r-1);
}

int main() {
    ll n;
    cin >> n;

    out(Comb(2*n + 7, 7) - 8 * Comb(n + 6, 7));
    re0;
}