#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define Add(x, y) (x + y >= mod) ? (x + y - mod) : (x + y)
#define lowbit(x) x & (-x)
#define pi pair<ll, ll>
#define pii pair<ll, pair<ll, ll>>
#define iip pair<pair<ll, ll>, ll>
#define ppii pair<pair<ll, ll>, pair<ll, ll>>
#define ls(k) k << 1
#define rs(k) k << 1 | 1
#define fi first
#define se second
#define full(l, r, x) for(auto it = l; it != r; ++it) (*it) = x
#define Full(a) memset(a, 0, sizeof(a))
#define open(s1, s2) freopen(s1, "r", stdin), freopen(s2, "w", stdout);
#define For(i, l, r) for(register int i = l; i <= r; ++i)
#define _For(i, l, r) for(register int i = r; i >= l; --i)
using namespace std;
using namespace __gnu_pbds;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
const int N = 101;
inline ll read(){
    ll x = 0, f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-')
          f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = (x << 1) + (x << 3) + (c ^ 48);
        c = getchar();
    }
    return x * f;
}
inline void write(ll x){
	if(x < 0){
		putchar('-');
		x = -x;
	}
	if(x > 9)
	  write(x / 10);
	putchar(x % 10 + '0');
}
ll sum, ans;
db x;
bool End;
int main(){
	scanf("%lf", &x);
    sum = x * 4 + 1e-9;
    for(int i = 0; i < N; ++i){
        for(int j = i; j < N; ++j){
            for(int k = j; k < N; ++k){
                int t = sum - i - j - k;
                if(t < 0 || t > 100)
				  continue;
                if(i == j && j == k && k == t)
                  ans += 1 + (i + 100 - t) * 6 + i * (100 - t) * 30;
                if(i == j && j == k && k < t)
                  ans += 15 + i * 60 + (100 - t) * 30 + i * (100 - t) * 120;
                if(i < j && j == k && k == t)
                  ans += 15 + i * 30 + (100 - t) * 60 + i * (100 - t) * 120;
                if(i == j && j < k && k == t)
                  ans += 20 + (i + 100 - t) * 60 + i * (100 - t) * 180;
                if(i < j && j < k && k == t)
                  ans += 60 + i * 120 + (100 - t) * 180 + i * (100 - t) * 360;
                if(i == j && j < k && k < t)
                  ans += 60 + i * 180 + (100 - t) * 120 + i * (100 - t) * 360;
                if(i < j && j == k && k < t)
                  ans += 90 + (i + 100 - t) * 180 + i * (100 - t) * 360;
                if(i < j && j < k && k < t)
                  ans += 180 + (i + 100 - t) * 360 + i * (100 - t) * 720;
            }
        }
    }
    write(ans);
	cerr << '\n' << abs(&Begin - &End) / 1048576 << "MB";
	return 0;
}