#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  double s;
  cin>>s;
  s*=4;
  ll sum=s;
  if(abs<double>(s-sum)>1e-3){
    cout<<0<<endl;
  }
  ll re=0;
  rep(a,101)rep(b,101)rep(c,101){
    int d=sum-a-b-c;
    if(d<0 || d>100) continue;
    int mn=min({a,b,c,d}),mx=max({a,b,c,d});
    re+=5*6*mn*(100-mx);
    if(a<=b && b<=c && c<=d){
      map<int,int> cnt;
      ++cnt[mx]; ++cnt[mn];
      for(int e:{a,b,c,d}){
	++cnt[e];
      }
      ll tmp=1*2*3*4*5*6;
      for(pii p:cnt) rep(i,p.Y) tmp/=i+1;
      re+=tmp;
    }
    if(mn)if(a<=b && b<=c && c<=d){
      map<int,int> cnt;
      ++cnt[mx]; ++cnt[mn-1];
      for(int e:{a,b,c,d}){
	++cnt[e];
      }
      ll tmp=1*2*3*4*5*6;
      for(pii p:cnt) rep(i,p.Y) tmp/=i+1;
      re+=tmp*mn;
    }
    if(mx<100)if(a<=b && b<=c && c<=d){
      map<int,int> cnt;
      ++cnt[mx+1]; ++cnt[mn];
      for(int e:{a,b,c,d}){
	++cnt[e];
      }
      ll tmp=1*2*3*4*5*6;
      for(pii p:cnt) rep(i,p.Y) tmp/=i+1;
      re+=tmp*(100-mx);
    }
  }
  cout<<re<<endl;
  
  return 0;
}