#include <cstdio>
#include <map>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
typedef long long ll;
using namespace std;
int fact(int n) {
    return n == 0 ? 1 : n * fact(n-1);
}
int perm(int a, int b, int c, int d, int e, int f) {
    map<int,int> g;
    g[a] += 1;
    g[b] += 1;
    g[c] += 1;
    g[d] += 1;
    g[e] += 1;
    g[f] += 1;
    int acc = 1;
    for (auto it : g) acc *= fact(it.second);
    return acc;
}
int main() {
    float x; scanf("%f", &x);
    int y = 4*x;
    ll ans = 0;
    repeat (b,100+1) {
        repeat_from (c,b,100+1) {
            repeat_from (d,c,100+1) {
                int e = y-b-c-d;
                if (e < d or 100 < e) continue;
                ans += fact(6) / perm(b,   b, c, d, e, e);
                ans += fact(6) / perm(b,   b, c, d, e, e+1)                   * max(0, 100-(e+1)+1);
                ans += fact(6) / perm(b-1, b, c, d, e, e+1) * max(0, (b-1)+1) * max(0, 100-(e+1)+1);
                ans += fact(6) / perm(b-1, b, c, d, e, e)   * max(0, (b-1)+1);
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}