#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int dp[300030];
int rev[300030];
int co[300030] = {};
int main() {
	int n;
	cin >> n;
	for (int i = 0; i <= n; i++) {
		dp[i] = 1000000007;
	}
	dp[0] = 0;
	for (int i = 1; i * i <= n; i++) {
		for (int j = 0; j <= n - i * i; j++) {
			if (dp[j + i * i] > dp[j] + i) {
				rev[j + i * i] = i;
			}
			dp[j + i * i] = min(dp[j + i * i], dp[j] + i);
		}
	}
	cout << dp[n] << endl;
	int now = n;
	while (now > 0) {
		co[rev[now]]++;
		now -= rev[now] * rev[now];
	}
	for (int i = 1; i <= n; i += 2) {
		for (int j = 0; j < co[i]; j++) {
			for (int k = 0; k < i; k++) {
				if (k % 2 == 0) {
					cout << 0;
				}
				else {
					cout << 1;
				}
			}
		}
	}
	int l = 0, r = n - n % 2, co1 = 0;
	while (r - l > 1) {
		if (co1 % 2 == 0) {
			for (int i = r; i >= 0; i -= 2) {
				if (co[i] != 0) {
					for (int j = 0; j < co[i]; j++) {
						for (int k = 0; k < i; k++) {
							if (k % 2 == 0) {
								cout << 0;
							}
							else {
								cout << 1;
							}
						}
					}
					r = i - 2;
					break;
				}
			}
		}
		else {
			for (int i = l; i <= n; i += 2) {
				if (co[i] != 0) {
					for (int j = 0; j < co[i]; j++) {
						for (int k = 0; k < i; k++) {
							if (k % 2 == 0) {
								cout << 1;
							}
							else {
								cout << 0;
							}
						}
					}
					l = i + 2;
					break;
				}
			}
		}
		co1++;
	}
	cout << endl;
}