#include #define whlie while #define pb push_back #define eb emplace_back #define fi first #define se second #define rep(i,N) for(int i = 0; i < (N); i++) #define repr(i,N) for(int i = (N) - 1; i >= 0; i--) #define rep1(i,N) for(int i = 1; i <= (N) ; i++) #define repr1(i,N) for(int i = (N) ; i > 0 ; i--) #define each(x,v) for(auto& x : v) #define all(v) (v).begin(),(v).end() #define sz(v) ((int)(v).size()) #define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++) #define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++) #define ini(...) int __VA_ARGS__; in(__VA_ARGS__) #define inl(...) ll __VA_ARGS__; in(__VA_ARGS__) #define ins(...) string __VA_ARGS__; in(__VA_ARGS__) #define rand rng using namespace std; void solve(); using ll = long long; using vi = vector; using vl = vector; using vvi = vector< vector >; constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1; mt19937_64 rng(58); struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya; template inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template ostream& operator <<(ostream& os, const pair &p) { os << p.first << " " << p.second; return os; } template istream& operator >>(istream& is, pair &p) { is >> p.first >> p.second; return is; } template ostream& operator <<(ostream& os, const vector &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; } template istream& operator >>(istream& is, vector &v) { for(auto &x : v) is >> x; return is; } void in(){} template void in(T &t,U &...u){ cin >> t; in(u...);} void out(){cout << "\n";} template void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);} templatevoid die(T x){out(x); exit(0);} #ifdef NyaanDebug #include "NyaanDebug.h" #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0) #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0) int main(){solve_dbg();} #else #define trc(...) #define trca(...) int main(){solve();} #endif using P = pair; constexpr int MOD = 998244853; ///////// int dp[300100]; void solve(){ ini(N); dp[0] = 0; for(int i = 1; i <= N; i++){ dp[i] = inf; for(int x = 1 ; x * x <= i; x++){ dp[i] = min(dp[i] , dp[i - x * x] + x); } } int cur = N; int s = 1; while(cur > 0){ s ^= 1; int x = 1; while(dp[cur] != dp[cur - x * x] + x) { x++; assert(cur - x * x >= 0); } rep(i , x) {cout << s; s ^= 1;} cur = cur - x * x; } out(); }