#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 101;

ll dp[2][MAX_N][MAX_N][6*MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    double x;
    cin >> x;
    int sm = round(4*x);
    ll ans = 0;
    dp[0][100][0][0] = 1;
    rep(i,6){
        rep(j,101){
            rep(k,101){
                rep(l,i*100+1){
                    dp[(i+1)%2][j][k][l] = 0;
                }
            }
        }
        rep(j,101){
            rep(k,101){
                rep(l,i*100+1){
                    if(dp[i%2][j][k][l]){
                        rep(m,101){
                            dp[(i+1)%2][min(j,m)][max(k,m)][l+m] += dp[i%2][j][k][l];
                        }
                    }
                }
            }
        }
    }
    rep(i,101){
        rep(j,101){
            rep(k,601){
                if(sm == k-i-j){
                    ans += dp[0][i][j][k];
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}