#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

long long n;
long long ans;

void dfs(long long cnt,long long sum){
    if(cnt==8){
        if(sum==6*n) ans++;
        return ;
    }
    for(int i=0;i<=n;i++){
        dfs(cnt+1,sum+i);
    }
}


int main()
{
/*
    for(int i=0;i<16;i++){
        n=i;
        ans=0;
        dfs(0,0);
        cout<<i<<" "<<ans<<endl;
    }
*/
    cin>>n;
    n++;
    //https://oeis.org/A179098
    long long res=n*(90+77*n+140*pow(n,3)+210*pow(n,4)+98*pow(n,5)+15*pow(n,6))/630;
    cout<<res<<endl;

    return 0;
}