#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<random>
#include<bitset>
#define N 30
using namespace std;
mt19937 RAND(random_device{}());
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,rt,delta[N+1];
int mul(int x,int y)
{
	int res=0;
	for (int i=0;i<n;++i) delta[i]=0;
	for (int i=0;i<(n>>1);++i)
		for (int j=0;j<(n>>1);++j)
			if (((x>>i)&1)&&((y>>j)&1))
				delta[i+j]^=1;
	for (int i=n-1;i>=(n>>1);--i)
		for (int t=0;t<(n>>1);++t)
			if ((rt>>t)&1)
				delta[i-(n>>1)+t]^=delta[i];
	for (int i=0;i<(n>>1);++i) res|=(delta[i]<<i);
	return res;
}
int main()
{
	bool op,opt;
	n=read();
	while (1)
	{
		opt=1,rt=RAND()%(1<<(n>>1));
		for (int i=1;i<=(n>>2);++i)
			for (int j=0;j<(1<<i);++j)
			{
				delta[n>>1]=op=1;
				for (int k=0;k<(n>>1);++k) delta[k]=(rt>>k)&1;
				for (int k=(n>>1);k>=i;--k)
					for (int t=0;t<=i-1;++t)
						if ((j>>t)&1)
							delta[k-i+t]^=delta[k];
				for (int k=0;k<=i-1;++k) op&=(!delta[k]);
				if (op) opt=0;
			}
		if (opt) break;
	}
	printf("%d\n",1<<(n>>1));
	for (int i=0;i<(1<<(n>>1));++i) printf("%d ",(i<<(n>>1))|mul(mul(i,i),i));
	puts("");
	return 0;
}