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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
void write(long double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

int main(void)
{
    int n=read<double>()*4;
    int frac[7]={1,1,2,6,24,120,720};
    ll res=0;
    rep(i,101)
    REP(j,i,101)
    { if(i+j>n)break;
    REP(k,j,101)
    { if(i+j+k>n)break;
    REP(v,k,101)
    {
        //int v=n-i-j-k;
        //if(v<0||v>100)continue;
        if(i+j+k+v<n)continue;
        if(i+j+k+v>n)break;
        int a[4]={(int)i,(int)j,(int)k,(int)v};
        //sort(a,a+4);
        Hash<int,int> h;
        rep(i,4)h[a[i]]++;
        ll fr=frac[6];
        for(auto at:h)fr/=frac[at.second];
        int minv=a[0],maxv=a[3];
        res+=fr*minv*(100-maxv);
        h[minv]++;
        fr=frac[6];
        for(auto at:h)fr/=frac[at.second];
        res+=fr*(100-maxv);
        h[minv]--;
        h[maxv]++;
        fr=frac[6];
        for(auto at:h)fr/=frac[at.second];
        res+=fr*minv;
        h[minv]++;
        fr=frac[6];
        for(auto at:h)fr/=frac[at.second];
        res+=fr;
        break;
    }
    }
    }
    write(res);
    return 0;
}