#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAX = 101;
ll dp[6][MAX][MAX][6*MAX];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    double X;
    cin >> X;
    for (int i = 0; i <= 100; i++)
        dp[0][i][i][i] = 1;
    for (int i = 1; i < 6; i++) for (int mini = 0; mini <= 100; mini++) {
        for (int maxi = mini; maxi <= 100; maxi++) for (int sum = i*mini; sum <= i*maxi; sum++) {
            if (!dp[i-1][mini][maxi][sum]) continue;
            for (int j = 0; j <= 100; j++) {
                dp[i][min(j, mini)][max(j, maxi)][sum+j] += dp[i-1][mini][maxi][sum];
            }
        }
    }
    int sum = 4*X;
    ll ans = 0;
    for (int i = 0; i <= 100; i++) for (int j = i; j <= 100; j++) {
        ans += dp[5][i][j][sum+i+j];
    }
    cout << ans << endl;
    return 0;
}