using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var dp = Enumerable.Repeat(int.MaxValue / 2, n + 1).ToArray();
        dp[0] = 0;
        for (var i = 1; i <= n; ++i)
        {
            for (var j = 1; j * j <= i; ++j)
            {
                dp[i] = Math.Min(dp[i], dp[i - j * j] + j);
            }
        }
        var cur = n;
        var ans = new List<int>();
        var prev = 0;
        while (cur > 0)
        {
            var max = (int)Math.Sqrt(cur);
            var flg = false;
            if (prev == 0)
            {
                for (var i = 1; i <= max; i += 2)
                {
                    if (dp[cur] == dp[cur - i * i] + i)
                    {
                        for (var j = 0; j < i; ++j) ans.Add(j % 2);
                        cur -= i * i;
                        flg = true;
                        break;
                    }
                }
                if (!flg)
                {
                    for (var i = max - max % 2; i > 0; i -= 2)
                    {
                        if (dp[cur] == dp[cur - i * i] + i)
                        {
                            for (var j = 0; j < i; ++j) ans.Add(j % 2);
                            cur -= i * i;
                            prev = 1;
                            break;
                        }
                    }
                }
            }
            else
            {
                for (var i = 2; i <= max; i += 2)
                {
                    if (dp[cur] == dp[cur - i * i] + i)
                    {
                        for (var j = 0; j < i; ++j) ans.Add(1 - j % 2);
                        cur -= i * i;
                        flg = true;
                        prev = 0;
                        break;
                    }
                }
                if (!flg)
                {
                    for (var i = max - (max % 2 == 0 ? 1 : 0); i > 0; i -= 2)
                    {
                        if (dp[cur] == dp[cur - i * i] + i)
                        {
                            for (var j = 0; j < i; ++j) ans.Add(1 - j % 2);
                            cur -= i * i;
                            break;
                        }
                    }
                }
            }
        }
        WriteLine(string.Concat(ans));
    }
}