#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

ll dp[7][201];

int main(void) {
    int i, j, k, n;
    cin >> n;

    dp[0][0] = 1;
    rep (i,6) REP (j,0,2*n) if (dp[i][j]) REP (k,0,n) if (j+k <= 2*n) {
        dp[i+1][j+k] += dp[i][j];
    }
    ll ans = 0;
    REP (i,0,n) REP (j,0,2*n) if (0 <= j-i && j-i <= n) {
        ans += dp[6][j];
    }
    cout << ans << endl;
    return 0;
}