#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>dp(n + 1, INF);
	dp[0] = 0;
	rep(i, n)for (int j = 0; i + j * j <= n; ++j) {
		chmin(dp[i + j * j], dp[i] + j);
	}
	string ans;
	while (n) {
		int type = 0;
		if (!ans.empty() && '1' == ans.back()) {
			type = 1;
		}
		bool chk = false;
		for (int i = 1 + type; i * i <= n; i += 2) {
			if (dp[n] != dp[n - i * i] + i) continue;
			chk = true;
			rep(j, i) {
				ans += '0' + type;
				type ^= 1;
			}
			n -= i * i;
			break;
		}
		if (chk)continue;
		int i = 2 - type;
		while ((i + 2) * (i + 2) <= n)i += 2;
		for (; i >= 1; i -= 2) {
			if (dp[n] != dp[n - i * i] + i) continue;
			rep(j, i) {
				ans += '0' + type;
				type ^= 1;
			}
			n -= i * i;
			break;
		}
	}
	cout << ans << endl;
	return 0;
}