#include<bits/stdc++.h>
using namespace std;
#define ull long long
const int  maxn = 1e6 + 5;
static int op[maxn][3],a[maxn],vis[maxn];
inline char nc() { static char buf[1000000], *p1 = buf, *p2 = buf; return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2) ? EOF : *p1++; }
inline void read(int &sum) { char ch = nc(); sum = 0; while (ch < '0') ch = nc(); while (ch >= '0') sum = (sum << 3) + (sum << 1) + (ch ^ 48), ch = nc(); }
__int128 dp[100];
int main()
{
	dp[0]=1;dp[1]=1;dp[2]=2;;
	for(int i=3;i<=64;i++)
	{
		dp[i]=dp[i-1];
		for(int j=2;j<=i;j++)
		{
		//	if(i==4)cout<<j<<" "<<(j-2)*(i-1-j)+1<<endl;
			dp[i]+=(j-2)*(i-j)+1;
		} 
	}
	ull n;
	while(cin>>n)
	{
		if(dp[n]<=1e18){
		cout<<(ull)dp[n]<<endl;continue;}
		ull res=dp[n]; 
		vector<int>nums;
		while(res)
		{
			nums.push_back(res%10);
			res/=10;
		}
		for(int i=nums.size()-1;i>=0;i--)cout<<nums[i];cout<<endl;
		
	}
	return 0;
}