#include <bits/stdc++.h>

#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP (i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back

using namespace std;

typedef long long ll;

const int INF = 1 << 29;

int nCr[10][10];

ll calc(vector<int> score) {
    if (score.front() < 0 || 100 < score.back()) return 0;

    int n = sz(score);
    int r = 1;
    int res = 1;

    int len = sz(score);
    score.eb(-1);

    rep (i, len) {
        if (score[i] == score[i + 1]) r++;
        else {
            res *= nCr[n][r];
            n -= r;
            r = 1;
        }
    }

    return res;
}

int main() {
    nCr[0][0] = 1;
    rep (i, 10) rep(j, 10) {
        if (i) nCr[i][j] += nCr[i - 1][j];
        if (i && j) nCr[i][j] += nCr[i - 1][j - 1];
    }

    double x;
    cin >> x;

    ll ans = 0;
    REP (i, 0, 101) REP (j, i, 101) REP (k, j, 101) {
        int l = (int)(x * 4) - i - j - k;
        if (k > l) continue;
        ans += calc(vector<int>{i - 1, i, j, k, l, l + 1}) * i * (100 - l);
        ans += calc(vector<int>{i - 1, i, j, k, l, l    }) * i;
        ans += calc(vector<int>{i    , i, j, k, l, l + 1})     * (100 - l);
        ans += calc(vector<int>{i    , i, j, k, l, l});
    }

    cout << ans << endl;
}