#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val1 = pair; using val2 = pair; using func = ll; val1 op1(val1 a, val1 b) { return MP(a.first * b.second + b.first, a.second * b.second); } val1 e1() { return MP(0, 1); } val2 op2(val2 a, val2 b) { return MP(a.first * b.second + b.first, a.second * b.second); } val2 e2() { return MP(0, 1); } val1 op1r(val1 a, val1 b) { return MP(b.first * a.second + a.first, a.second * b.second); } val1 e1r() { return MP(0, 1); } val2 op2r(val2 a, val2 b) { return MP(b.first * a.second + a.first, a.second * b.second); } val2 e2r() { return MP(0, 1); } //val mp(func f, val a) { // return MP(a.first + f * a.second, a.second); //} func comp(func f, func g) { return f + g; } func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; VL res; ll ressum; void solve2(ll n, ll bef, ll sum, VL& now) { if (n == 0) { VL tt = now; SORT(tt); VL tmp; ll l = 0, r = now.size() - 1; bool z = true; while (l <= r) { if (tt[l] % 2) tmp.push_back(tt[l++]); else if (z) { tmp.push_back(tt[l++]); z = false; } else { tmp.push_back(tt[r--]); z = true; } } if (ressum > sum) { res = tmp; ressum = sum; } else if (ressum < sum) return; else CHMIN(res, tmp); return; } ROF(i, 1, bef + 1) { ll v = i * i; if (sum + n / v * i > ressum) break; if (n - v < 0) continue; if (i % 2) { now.push_back(i); } else { now.push_back(10000 - i); } solve2(n - v, i, sum + i, now); now.pop_back(); } } void solve() { ll n; cin >> n; res.assign(n, 1); ressum = n; VL now; solve2(n, 600, 0, now); bool z = true; for (auto& v : res) { ll c = v % 2 ? v : 10000 - v; REP(i, c) { if (z)cout << '0'; else cout << '1'; z ^= true; } z ^= true; } return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }