#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll dp[7][101][101][601];

int main() {
    int X, Y;
    scanf("%d.%d\n", &X, &Y);
    X = 100 * X + Y;
    X = X * 4 / 100;
    vector<vector<vector<ll>>> dp(101, vector<vector<ll>>(101, vector<ll>(1)));
    dp[100][0][0] = 1;
    for(int i = 0; i < 6; i++){
        vector<vector<vector<ll>>> ndp(101, vector<vector<ll>>(101, vector<ll>(100 * (i + 1) + 1)));
        for(int j = 0; j <= 100; j++){
            for(int k = 0; k <= 100; k++){
                for(int l = 100 * i; l >= 0; l--){
                    if(dp[j][k][l] == 0) continue;
                    for(int m = 0; m <= 100; m++){
                        ndp[min(m, j)][max(m, k)][l + m] += dp[j][k][l];
                    }
                }
            }
        }
        swap(dp, ndp);
    }
    ll ans = 0;
    for(int i = 0; i <= 100; i++){
        for(int j = 0; j <= 100; j++){
            for(int k = 0; k <= 600; k++){
                if(k - i - j == X) ans += dp[i][j][k];
            }
        }
    }
    cout << ans << '\n';
}