#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int X;
ll fac[7] = {1, 1, 2, 6, 24, 120, 720};

ll cnt(vector<int> v){
    ll ans = fac[6];
    int cnt = 1;
    int cur = v[0];
    for(int i = 1; i < 6; i++){
        if(cur != v[i]){
            ans /= fac[cnt];
            cnt = 1;
            cur = v[i];
        }else{
            cnt++;
        }
    }
    ans /= fac[cnt];
    // for(int i : v) cout << i << ' ';
    // cout << endl;
    // cout << ans << endl;
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    double x; cin >> x; x = x*4+0.01;
    X = (int)x;
    ll ans = 0;
    vector<int> v(6);
    for(ll l = 0; l <= 100; l++){
        for(ll r = l; r <= 100; r++){
            for(ll c = l; c <= r; c++){
                ll rem = X-(l+r+c);
                if( rem < c || rem > r) continue;
                // cout << l << ' '  << c << ' ' << rem << ' ' << r << endl;
                v[1] = l; v[2] = c; v[3] = rem; v[4] = r;
                // min < l && max > r
                v[0] = -1; v[5] = 101;
                ans += cnt(v)*l*(100-r);
                // min < l && max == r
                v[0] = -1; v[5] = r;
                ans += cnt(v)*l;
                // min == l && max > r
                v[0] = l; v[5] = 101;
                ans += cnt(v)*(100-r);
                // min == l && max == r
                v[0] = l; v[5] = r;
                ans += cnt(v);
            }
        }
    }
    cout << ans << endl;
}