#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; int n; int dp[300010]; void solve(){ cin >> n; rep(i,n+1){ dp[i]=mod; } dp[0]=0; rep(i,n+1){ for(int k=1;i+k*k<=n;k++){ dp[i+k*k]=min(dp[i+k*k],dp[i]+k); } } rep(i,n+1){ //cout << i << " " << dp[i] << endl; } int l=dp[n],m=n; vector ans; while(l>0){ bool flag=false; for(int k=1;m-k*k>=0 && l-k>=0;k+=2){ if(dp[m-k*k]==l-k){ m-=k*k; l-=k; ans.push_back(k); flag=true; break; } } if(flag) continue; int j=2; while(m-(j+2)*(j+2)>=0){ j+=2; } for(int k=j;k>=2;k-=2){ if(dp[m-k*k]==l-k){ m-=k*k; l-=k; ans.push_back(k); break; } } } int k=0; for(int s:ans){ rep(i,s){ cout << k%2 << ""; k++; } k--; } cout << "" << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }