import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto r = cast(long)sqrt(cast(double)N);
	auto list = new long[](r);
	foreach (i; 0..r)
	{
		list[i] = (i+1)^^2;
	}
	auto list_ = assumeSorted(list);
	
	long[] a = [0, 0, 0, 0, 0];
	(){
	foreach_reverse (i; 0..r)
	{
		auto x = N - list[i];
		if (x < 0) continue;
		else if (x == 0)
		{
			a = [i+1];
			return;
		}
		foreach_reverse (j; 0..i+1)
		{
			auto y = x - list[j];
			if (y < 0) continue;
			else if (y == 0)
			{
				a = [i+1, j+1];
			}
			else if (a.length > 3) continue;
			foreach_reverse (k; 0..j+1)
			{
				auto z = y - list[k];
				if (z < 0) continue;
				else if (z == 0)
				{
					a = [i+1, j+1, k+1];
				}
				else if (a.length > 4)
				{
					auto p = list_.lowerBound(z);
					if (p.length == list_.length)
						continue;
					a = [i+1, j+1, k+1, p.length];
				}
			}
		}
	}}();

	long[] b, c;
	foreach (e; a)
	{
		if (e % 2 != 0)
			b ~= e;
		else
			c ~= e;
	}
	string ans;
	b.sort();
	c.sort!"a > b"();
	foreach (e; b)
	{
		foreach (i; 0..e)
			ans ~= i % 2 == 0 ? "0" : "1";
	}
	auto str = "01";
	foreach (i, e; c)
	{
		foreach (j; 0..e)
			ans ~= (i+j) % 2 == 0 ? "0" : "1";
	}

	writeln(ans);
	stdout.flush();
	debug readln();
}