// yukicoder: No.688 E869120 and Constructing Array 2
// 2019.7.12 bal4u

#include <stdio.h>
#include <math.h>

int sp;
void out(int n) {
	if (!sp) sp = 1; else putchar(' ');
	putchar('0'+n);
}

int calc(long long k) {
	int b = (int)sqrt((double)(1+(k<<2)));
	long long bb = (long long)b*b - 1;
	if (bb % 4 == 0 && bb / 4 == k) return (1+b) >> 1;
	return -1;
}

int main()
{
	int p, zero, one;
	long long K;
	
	scanf("%lld", &K);
	zero = 0, K <<= 1;
	while ((one = calc(K)) < 0 || zero+one > 30) zero++, K >>= 1;
	printf("%d\n", zero+one);
	while (zero--) out(0);
	while (one--) out(1);
	putchar('\n');
	return 0;
}