#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template
ll fact(int n){
    ll ret = 1;
    repd(i, 1, n + 1){
        ret *= i;
    }
    return ret;
}

ll comb(int n, int m){
    return fact(n) / fact(m) / fact(n - m);
}

int count(vector<int> cnt){
    int cur = 6;
    int perm = 1;
    rep(p, cnt.size()){
        perm *= comb(cur, cnt[p]);
        cur -= cnt[p];
    }
    return perm;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    double X;
    cin >> X;
    int Y = (int)(X * 4);
    ll sum = 0;
    rep(i, 101) repd(j, i, 101) repd(k, j, 101){
        int l = Y - i - j - k;
        if(k > l || l > 100) continue;
//        cout << i << ", " << j << ", " << k << ", " << l << endl;
        vector<int> nums = {i, j, k, l};
        vector<int> cnt = {1};
        
        repd(p, 1, nums.size()){
            if(nums[p] == nums[p - 1]) cnt.back()++;
            else cnt.pb(1);
        }
        int perm = 1;
        int cur = 4;
        rep(p, cnt.size()){
            perm *= comb(cur, cnt[p]);
            cur -= cnt[p];
        }
        
        if(i == l){
            int tmp = 0;
            tmp += i * (100 - i) * 30;
            tmp += i * 6;
            tmp += (100 - l) * 6;
            tmp += 1;
            sum += tmp;
            continue;
        }
        int tmp = 0;
        // 両端が同じ
        auto v = cnt;
        v.front()++, v.back()++;
//        output(count(v), 0);
        tmp += count(v);
        v = cnt;
        v.front()++, v.pb(1);
//        output(count(v) * (100 - l), 0);
        tmp += count(v) * (100 - l);
        v = cnt;
        v.back()++, v.pb(1);
//        output(count(v) * i, 0);
        tmp += count(v) * i;
        v = cnt;
        v.pb(1), v.pb(1);
//        output(count(v) * i * (100 - l), 0);
        tmp += count(v) * i * (100 - l);
        
        sum += tmp;
        
    }
    
    output(sum, 0);
    
    
    return 0;
}