#include<bits/stdc++.h>
using namespace std;
/*--------------------------------------------------------------------------------------*/
#define cin cio
#define cout cio
#define Fs 100000
#define inline __inline__ __attribute__((always_inline))
#define iopt inline IO& operator
#define Tc()(_A==_B&&(_B=(_A=Fi)+fread(Fi,1,100000,stdin),_A==_B)?EOF:*_A++)
#define Pc(Ch)(FS<Fs?Fo[FS++]=Ch:(fwrite(Fo,1,Fs,stdout),Fo[(FS=0)++]=Ch))
int Tp,FS;char Ch,*_A,*_B,Fi[Fs],Fo[Fs],Sk[Fs];
struct IO{
	template<typename T>
	iopt>>(T&x){x=0;while(!isdigit(Ch=Tc()));while(x=10*x +(Ch&15),isdigit(Ch=Tc()));return*this;}
	iopt>>(char*x){int I=0;for(;((x[I]=Tc())!=' ')&&(x[I]!='\n');++I);x[I]='\0';return*this;}
	iopt>>(char&x){x=Tc();return*this;}
	template<typename T>
	iopt<<(T x){if(!x){return Pc('0'),*this;}if(x<0)Pc('-'),x=-x;while(x)Sk[++Tp]=x%10+48,x/=10;while(Tp)Pc(Sk[Tp--]);return*this;}
	iopt<<(const char*x){for(;*x!='\0';Pc(*(x++)));return*this;}
	iopt<<(char x){Pc(x);return*this;};~IO(){fwrite(Fo,1,FS,stdout),FS=0;}void tie(int){}
}cio;/*----------------------------------------------------------------------------------*/
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#define fi first
#define se second
#define era erase
#define ins insert
#define it iterator
#define lb lower_bound
#define ub upper_bound
#define exc(exp) if(exp)continue;
#define ret(exp) if(exp)return;
#define stop(exp) if(exp)break;
#define quit(sth) {sth;return;}
#define let(var...) int var;tie(var)
#define siz(vec) ((int)((vec).size()))
#define all(vec) (vec).begin(),(vec).end()
#define unq(vec) sort(all(vec)),(vec).erase(unique(all(vec)),(vec).end())
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define int long long
#define db double
#define ld long double
#define ull unsigned long long
#define inf (long long)(1e18)
bool Max(int &x,int y){if(x<y)return x=y,1;return 0;}
bool Min(int &x,int y){if(x>y)return x=y,1;return 0;}
const int mod=998244353;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
int add(int x,int y){return x+y<mod?x+y:x+y-mod;}
int fpm(int x,int y){
	int ans=1;for(;y;y>>=1,(x*=x)%=mod)if(y&1)(ans*=x)%=mod;return ans;
}

struct num_t{
	int l,w[100];
	num_t(){
		l=0;memset(w,0,sizeof w);
	}
	num_t(int x){
		l=0;memset(w,0,sizeof w);
		if(x!=0){
			while(x){
				w[l++]=x%10;x/=10;
			}
			--l;
		} 
	}
	int& operator [](int k){
		return w[k];
	}
	void out(){
		for(int i=l;~i;i--)cout<<w[i];cout<<'\n';
	}
	friend num_t operator +(num_t a,num_t b){
		num_t c;
		c.l=max(a.l,b.l);
		for(int i=0;i<=c.l;i++){
			c[i]+=a[i]+b[i];
			c[i+1]+=c[i]/10,c[i]%=10; 
		}
		while(c[c.l+1])++c.l,c[c.l+1]+=c[c.l]/10,c[c.l]%=10;
		return c;
	}
	friend num_t operator *(num_t a,num_t b){
		num_t c;
		for(int i=0;i<=a.l;i++)
			for(int j=0;j<=b.l;j++)
				c[i+j]+=a[i]*b[j];
		c.l=a.l+b.l;
		for(int i=0;i<=c.l;i++){
			c[i+1]+=c[i]/10,c[i]%=10;
		} 
		while(c[c.l+1])++c.l,c[c.l+1]+=c[c.l]/10,c[c.l]%=10;
		while(c.l>0&&!c[c.l])--c.l;
		return c;
	}
	friend bool operator <=(num_t a,num_t b){
		if(a.l<b.l)return 1;
		if(a.l>b.l)return 0;
		for(int i=a.l;~i;i--){
			if(a[i]>b[i])return 0;
			if(a[i]<b[i])return 1;
		}			return 1;
	}
}; 

#define i128 num_t

int n;
i128 C(int m){
	if(m==-1)return i128(0);
	if(m&1)return i128((m+1)/2)*i128(m);
	else return i128(m/2)*i128(m+1);
}
i128 mul(int a,int b){
	if(a&1)return i128(a)*i128(b/2);
	return i128(a/2)*i128(b);
}
i128 f(int m){
	if(m==-1)return i128(0);
	if(n&1){
		i128 gd=i128(5)+i128(11)*i128(m)+C(m)*i128(5);
		i128 co=i128(11)+i128(m+1)*i128(10); 
		return i128(n+1)*i128(5)+i128((n-1)/2-m)*(i128(11)+i128(m+1)*i128(5)+gd)+co*C((n-1)/2-m-1)+gd+co*i128((n-1)/2-m)+i128(m+1)*i128(5);
	}else{
		i128 gd=i128(11)+i128(11)*i128(m)+mul(m+3,m)*i128(5);
		i128 co=i128(11)+i128(m+2)*i128(10);
		return i128(n)*i128(5)+i128(n/2-m-1)*(i128(11)+i128(m+2)*i128(5)+gd)+co*C(n/2-m-2)+gd+i128(n/2-m-1)*co+i128(m+2)*i128(5); 
	}
}
void work(){
	cin>>n;
	if(n==0)cout<<"0\n";
	else if(n==1)cout<<"20\n";
	else if(n==2)cout<<"42\n";
	else if(n==3)cout<<"72\n";
	else if(n==4)cout<<"105\n";
	else{
		int l=-1,r=((n&1)?n/2:n/2-1)-1;
		while(l<r){
			int mid=(l+r+1)>>1;
			if(f(mid)<=f(mid+1))l=mid;else r=mid-1;
		}
		f(l+1).out();
	}
}
signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T=1;while(T--)work();
}
/*
 * CONTINUE, NON-STOPPING, FOR THE FAITH
 * START TYPING IF YOU DON'T KNOW WHAT TO DO
 * STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
 */