#include <iostream>
#include <utility>
#include <algorithm>
#include <queue>
#include <vector>
#define llint long long

using namespace std;

llint n;
llint dp[300005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for(int i = 0; i <= n; i++) dp[i] = 1e9;
	dp[0] = 0;
	
	for(int i = 1; i <= n; i++){
		for(int j = 1; j*j <= i; j++){
			dp[i] = min(dp[i], dp[i-j*j]+j);
		}
	}
	//for(int i = 0; i <= n; i++) cout << i << " " << dp[i] << endl;
	
	vector<llint> vec;
	llint rem = n, cnt = dp[n];
	for(llint i = 1; i <= rem; i+=2){
		llint mx = 0;
		for(llint j = 1; i*i*j <= rem; j++){
			if(dp[rem-i*i*j] == cnt-i*j) mx = j;
		}
		for(llint j = 0; j < mx; j++) vec.push_back(i);
		rem -= mx*i*i, cnt -= mx*i;
	}
	for(llint i = (n+1)/2*2; i >= 2; i-=2){
		llint mx = 0;
		for(llint j = 1; i*i*j <= rem; j++){
			if(dp[rem-i*i*j] == cnt-i*j) mx = j;
		}
		for(llint j = 0; j < mx; j++) vec.push_back(i);
		rem -= mx*i*i, cnt -= mx*i;
	}
	
	vector<llint> ovec, evec;
	for(int i = 0; i < vec.size(); i++){
		if(vec[i]%2) ovec.push_back(vec[i]);
		else evec.push_back(vec[i]);
	}
	reverse(evec.begin(), evec.end());
	
	vec.clear();
	for(int i = 0; i < ovec.size(); i++) vec.push_back(ovec[i]);
	for(int i = 0; i < evec.size(); i++) vec.push_back(evec[i]);
	
	string ans;
	for(int i = 0; i < vec.size(); i++){
		for(int j = 0; j < vec[i]; j++) ans += ('0' + (i%2));
	}
	for(int i = 0; i < ans.size(); i++){
		if(i%2){
			if(ans[i] == '0') ans[i] = '1';
			else ans[i] = '0';
		}
	}
	cout << ans << endl;
	
	return 0;
}