#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional> 
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <cstring>
#include <fstream>
#include <random>

using namespace std;

int dp[300001];
int history[300001];
int n;

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	fill(dp, dp + 300001, 1e9);
	memset(history, -1, sizeof(history));

	dp[0] = 0;
	for (int i = 0; i <= 300000; i++)
	{
		if (dp[i] >= 1e9) continue;
		for (int j = 1; ; j++)
		{
			if (i + j * j > 300000) break;
			if (dp[i + j * j] >= dp[i] + j)
			{
				dp[i + j * j] = dp[i] + j;
				history[i + j * j] = i;
			}
		}
	}

	cin >> n;

	vector <int> odd, even;

	int num = n;
	while (num > 0)
	{
		int p = history[num];
		int N = sqrt(num - p);
		if (N % 2)
		{
			odd.push_back(N);
		}
		else
		{
			even.push_back(N);
		}
		num = p;
	}

	sort(odd.begin(), odd.end());
	sort(even.rbegin(), even.rend());

	for (int i = 0; i < odd.size(); i++)
	{
		int N = 0;
		for (int j = 0; j < odd[i]; j++)
		{
			cout << N;
			N = 1 - N;
		}
	}
	
	int N = 1;
	int l = 0;
	int r = even.size() - 1;
	bool ok = true;
	while (l<=r)
	{
		N = 1 - N;
		if (ok)
		{
			for (int j = 0; j < even[l]; j++)
			{
				cout << N;
				N = 1 - N;
			}
			l++;
			ok = false;
		}
		else
		{
			for (int j = 0; j < even[r]; j++)
			{
				cout << N;
				N = 1 - N;
			}
			r--;
			ok = true;
		}
	}
	cout << '\n';

	return 0;
}