#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 
ll dp[610][101][101];//sum,min,max
ll ndp[610][101][101];
int main(){
    double t;cin >> t;t*=4;
    memset(dp,0,sizeof(dp));
    dp[0][100][0]=1;
    rep(i,6){
        memset(ndp,0,sizeof(ndp));
        rep(i,601){
            rep(j,101){
                rep(k,101){
                    if(dp[i][j][k]==0)continue;
                    rep(to,101){
                        ndp[i+to][min(j,to)][max(k,to)]+=dp[i][j][k];
                    }
                }
            }
        }
        swap(dp,ndp);
    }
    ll ans=0;
    rep(i,601){
        rep(j,101){
            rep(k,101){
                if(i-j-k==t)ans+=dp[i][j][k];
            }
        }
    }
    cout << ans << endl;

}