#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000

bool compare(vector<int> &A,vector<int> &B){
	vector<int> odd[2],even[2];
	for(int i=0;i<A.size();i++){
		if(A[i]%2==1)odd[0].push_back(A[i]);
		else even[0].push_back(A[i]);
	}
	for(int i=0;i<B.size();i++){
		if(B[i]%2==1)odd[1].push_back(B[i]);
		else even[1].push_back(B[i]);
	}
	
	for(int i=0;i<2;i++)reverse(odd[i].begin(),odd[i].end());
	
	if(odd[0]<odd[1])return true;
	if(odd[1]<odd[0])return false;
	
	if(even[0]>even[1])return true;
	return false;
	
}

int main(){
	
	int N;
	cin>>N;

	vector<int> V;
	for(int i=0;true;i++){
		if(i*i>N)break;
		V.push_back(i*i);
	}
	
	int mini = Inf;
	vector<int> ans;
	for(int i=1;i<V.size();i++){
		if(i>mini)continue;
		if(V[i]==N){
			vector<int> A;
			A.push_back(i);
			ans = A;
		}
		
		for(int j=1;j<V.size();j++){
			if(i+j>mini||ans.size()==1)continue;
			if(V[i]+V[j]==N){
				vector<int> A={i,j};
				sort(A.begin(),A.end(),greater<int>());
				if(compare(A,ans)||mini>i+j){
					ans = A;
					mini=i+j;
				}
			}
			
			for(int k=1;k<V.size();k++){
				if(i+j+k>mini||ans.size()==2)continue;
				if(V[i]+V[j]+V[k]==N){
					vector<int> A={i,j,k};
					sort(A.begin(),A.end(),greater<int>());
					if(compare(A,ans)||mini>i+j+k){
						ans=A;
						mini=i+j+k;
					}
				}
				
				if(ans.size()==3)continue;
				int ind = lower_bound(V.begin(),V.end(),N-V[i]-V[j]-V[k])-V.begin();
				if(ind==N)continue;
				if(i+j+k+ind>mini)continue;
				if(V[i]+V[j]+V[k]+V[ind]==N){
					vector<int> A = {i,j,k,ind};
					sort(A.begin(),A.end(),greater<int>());
					if(compare(A,ans)||mini>i+j+k+ind){
						ans=A;
						mini=i+j+k+ind;
					}
				}
				
			}
		}
	}
	
	vector<int> odd,even;
	vector<int> A;
	for(int i=0;i<ans.size();i++){
		if(ans[i]%2==0)even.push_back(ans[i]);
		else odd.push_back(ans[i]);
	}
	
	reverse(odd.begin(),odd.end());
	for(int i=0;i<odd.size();i++)A.push_back(odd[i]);
	for(int i=0;i<even.size();i++)A.push_back(even[i]);
	
	ans = A;
	
	
	int last = 0;
	
	for(int i=0;i<ans.size();i++){
		for(int j=0;j<ans[i];j++){
			if(j%2==0)cout<<last;
			else cout<<(last^1);		
		}
		if(ans[i]%2==0)last^=1;
	}
	cout<<endl;
		
		
	
	return 0;
}