#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    double x;
    cin >> x;

    int p = x * 4 + 0.50;

    int MOD = 1e9+7;
    int ans = 0;

    rep(i,101){
        srep(j,i,101){
            srep(k,j,101){
                int q = p - (i + j + k);
                if(k <= q && q <= 100){
                    ans += (i + 1) * (100 - q + 1);
                    ans %= MOD;
                }
            }
        }
    }

    cout << ans << endl;
    return 0;
}