#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
typedef vector<vector<int>> Graph;
const int inf = 1e9;
const int mod = 1e9 + 7;

int fact[] = {1, 1, 2, 6, 24, 120, 720};

int perm(map<int, int> cnt, int x1, int x2) {
    if (x1 != -1) cnt[x1]++;
    if (x2 != -1) cnt[x2]++;
    int ret = fact[6];
    for (auto&& p : cnt) {
        ret /= fact[p.second];
    }
    // cout << ret << endl;
    return ret;
}

signed main() {
    // std::ios::sync_with_stdio(false);
    // std::cin.tie(0);

    double x;
    cin >> x;
    int sm = 4 * x;

    const int MAX = 100;
    int ans = 0;
    rep(a1, MAX + 1) {
        rep2(a2, a1, MAX + 1) {
            rep2(a3, a2, MAX + 1) {
                int a4 = sm - a1 - a2 - a3;
                if (!(a3 <= a4 && a4 <= MAX)) continue;
                // cout << a1 << " " << a2 << " " << a3 << " " << a4 << endl;
                map<int, int> cnt;
                cnt[a1]++;
                cnt[a2]++;
                cnt[a3]++;
                cnt[a4]++;
                if (a1 != 0 && a4 != MAX)   ans += perm(cnt, -1, -1) * a1 * (MAX - a4);
                if (a4 != MAX)              ans += perm(cnt, a1, -1) * (MAX - a4);
                if (a1 != 0)                ans += perm(cnt, a4, -1) * a1;
                ans += perm(cnt, a1, a4);
                // cout << ans << endl;
            }
        }
    }

    cout << ans << endl;

}