#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

vector<ll> dp;

ll dfs(ll cur) {
	if (dp[cur] != -1) return dp[cur];
	if (cur == 0) return dp[0] = 0;
	ll res = INF;
	for (ll i = 1; i * i <= cur; i++) {
		chmin(res, dfs(cur - i * i) + i);
	}
	return dp[cur] = res;
}

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll N; scanf("%lld", &N);
	dp = vector<ll>(N + 1, -1);
	dfs(N);
	dp[0] = 0;
	ll now = N;
	//cout << dp[N] << endl;
	string res;
	vector<ll> cnt;
	while (now > 0) {
		for (ll i = 1; i <= N; i++) {
			if (dp[now - i * i] + i == dp[now]) {
				cnt.push_back(i);
				now -= i * i;
				break;
			}
		}
	}
	sort(cnt.begin(), cnt.end());
	int c = 0;
	for (ll i = 0; i < cnt.size(); i++) {
		for (ll j = 0; j < cnt[i]; j++) {
			res += (char)(c + '0');
			if (j != cnt[i] - 1) c = (c + 1) % 2;
		}
	}
	cout << res << endl;
	return 0;
}