#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<vector>
#include<map>
using namespace std;
typedef long ll;
const ll maxn=105;
const ll mod=10007;
const ll base=10000;
const ll maxxn=0x7fffffff;
const ll minxn=-0x7fffffff;
inline ll read(){
	ll x=0,w=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
	while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
	return x*w;
}
ll n;
ll a[maxn],b[maxn],c[maxn],d[maxn];
int main(){
    a[0]=b[0]=c[0]=d[0]=1;
    for(int i=1;i<=64;i++){
    	a[i]=i+1;
    	b[i]=b[i-1]+a[i-1];
    	c[i]=c[i-1]+b[i-1];
    	d[i]=d[i-1]+c[i-1];
	}
    while(cin>>n){
        if(!n){
			printf("1\n");
		}
        else printf("%lld\n",d[n-1]);
    }
    return 0;
}