ll s;
void f(ll h,ll d[][1<<20],ll*n){
	n[0]=1;
	d[0][0]=0;
	rep(i,h){
		ll@a;
		s+=a;
		rrep(j,h){
			rep(k,n[j]){
				d[j+1][n[j+1]++]=d[j][k]+a;
			}
		}
	}
}
{
	ll@n;
	ll h=n/2;
	ll ad[21][1<<20],an[21]{};
	ll bd[21][1<<20],bn[21]{};
	f(h,ad,an);
	f(h,bd,bn);
	ll z=ll_inf;
	rep(i,h+1){
		sortA(an[i],ad[i]);
		sortA(bn[h-i],bd[h-i]);
		ll ai=0,bi=bn[h-i]-1;
		while(ai<an[i]&&bi>=0){
			ll c=(ad[i][ai]+bd[h-i][bi])*2-s;
			z<?=abs(c);
			if(c<0){
				++ai;
			}else{
				--bi;
			}
		}
	}
	wt(z);
}