# include <iostream>
# include <cstdio>
# include <queue>
# include <vector>
# include <stack>
# include <map>
# include <cmath>
# include <algorithm>
# include <stdio.h>
using namespace std;
int dp[185];

int main()
{
freopen ("darts.out","w",stdout);
freopen ("darts.in","r",stdin);
int n;
int i;
scanf("%d",&n);
dp[n]=1;
int p,j;
long long shans=0;
if(n%2==0&&n<=40)shans++;
if(n==50)shans++;
//cout<<shans<<endl;
//for(p=1;p<=3;p++)

    for(i=1;i<=n;i++)
    {
      //  dp[i]+=dp[i];
        for(j=1;j<=20;j++)
        {
            dp[i]+=dp[i+j];
            dp[i]+=dp[i+2*j];
            dp[i]+=dp[i+3*j];
        }
      dp[i]+=dp[i+25];
        dp[i]+=dp[i+50];
    }
for(i=1;i<=20;i++)
{
    shans+=dp[2*i];
  //  cout<<i<<" "<<dp[2*i]<<endl;
}
shans+=dp[50];
//cout<<shans<<endl;
int f;
 for(i=1;i<=n;i++)
    {

        f=dp[i];
       // dp[i]+=dp[i];
        for(j=1;j<=20;j++)
        {
            dp[i]+=dp[i+j];
            dp[i]+=dp[i+2*j];
            dp[i]+=dp[i+3*j];
        }
        dp[i]+=dp[i+25];
        dp[i]+=dp[i+50];
    }
for(i=1;i<=20;i++)
{
    shans+=dp[2*i];
       // cout<<i<<" "<<dp[2*i]<<endl;
}
shans+=dp[50];
printf("%lld\n",shans);
}