#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int; using i64 = long long; using ui64 = unsigned long long; using i128 = __int128;
const int INF = 1e9; const i64 LLNF = 4e18;

template< class Tp > void chkmax( Tp &x, Tp y ) { x = max( x, y ); }
template< class Tp > void chkmin( Tp &x, Tp y ) { x = min( x, y ); }

int log( int x ) { return 31 - __builtin_clz( x ); }
int log( i64 x ) { return 63 - __builtin_clzll( x ); }

mt19937 rng( 19260817 );
int randint( int l, int r ) { return rng( ) % ( r - l + 1 ) + l; }

vector< int > encode( int m, int x ) { vector< int > u( m ); for( int i = 0; i < m; i ++ ) u[i] = ( x >> i ) & 1; return u; }
int decode( int m, vector< int > u ) { int x = 0; for( int i = 0; i < m; i ++ ) x |= ( u[i] << i ); return x; }

vector< vector< int > > generate_mul( int m ) {
	vector< int > mod( m + 1 );
	while( true ) {
		for( int k = 0; k <= m; k ++ ) mod[k] = ( k == m ? 1 : randint( 0, 1 ) );
		bool irr = true;
		for( int x = 2; x < ( 1 << m ); x ++ ) {
			int deg = log( x );
			vector< int > v( deg + 1 ); for( int l = 0; l <= deg; l ++ ) v[l] = ( x >> l ) & 1;
			vector< int > u = mod;
			for( int k = m; k >= deg; k -- ) { int t = u[k]; for( int l = 0; l <= deg; l ++ ) u[k - l] = ( u[k - l] + 2 * 2 - v[l] * t ) % 2; }
			irr &= ( u != vector< int >( m + 1, 0 ) );
		}
		if( irr ) break;
	}

	int N = 1 << m; vector< vector< int > > mul( N, vector< int >( N ) );
	for( int x = 0; x < N; x ++ ) for( int y = 0; y < N; y ++ ) {
		vector< int > u = encode( m, x ), v = encode( m, y );
		vector< int > w( 2 * m - 1 );
		for( int k = 0; k < m; k ++ ) for( int l = 0; l < m; l ++ ) w[k + l] = ( w[k + l] + u[k] * v[l] ) % 2;
		for( int k = 2 * m - 2; k >= m; k -- ) { int t = w[k]; for( int l = 0; l <= m; l ++ ) w[k - l] = ( w[k - l] + 2 * 2 - mod[l] * t ) % 2; }
		int z = decode( m, w );
		mul[x][y] = z;
	}
	return mul;
}

void solve( ) {
	int n; cin >> n;
	int m = n / 2;

	vector< vector< int > > mul = generate_mul( m );
	vector< int > ans; for( int x = 0; x < ( 1 << m ); x ++ ) ans.emplace_back( ( mul[x][mul[x][x]] << m ) | x );
	cout << ( int ) ans.size( ) << "\n"; for( int x : ans ) cout << x << " "; cout << "\n";
}

int main( ) {
	ios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
	int T = 1; while( T -- ) solve( ); return 0;
}