#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
template<C T>void pr(T a){cout<<a;ln;}
template<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

ll dp[101][101][2][601];

void Main() {
  double n;
  cin >> n;
  ll sum=n*4,ans=0;
  dp[100][0][0][0]=1;
  rep(t,6) {
    rep(i,101) {
      rep(j,101) {
        rep(k,t*100+1) {
          if(!dp[i][j][0][k]) continue;
          rep(l,101) dp[min(i,l)][max(j,l)][1][k+l]+=dp[i][j][0][k];
        }
      }
    }
    rep(i,101) {
      rep(j,101) {
        rep(k,(t+1)*100+1) {
          dp[i][j][0][k]=dp[i][j][1][k];
          dp[i][j][1][k]=0;
        }
      }
    }
  }
  rep(i,101)rep(j,101)ans+=dp[i][j][0][sum+i+j];
  pr(ans);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}