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 list = new List<int>();
        while (cur > 0)
        {
            for (var i = (int)Math.Sqrt(cur); i > 0; --i)
            {
                if (dp[cur] == dp[cur - i * i] + i)
                {
                    list.Add(i);
                    cur -= i * i;
                    break;
                }
            }
        }
        var odd = new List<int>();
        var even = new List<int>();
        foreach (var li in list)
        {
            if (li % 2 == 0) even.Add(li);
            else odd.Add(li);
        }
        odd.Sort((l, r) => r.CompareTo(l));
        even.Sort((l, r) => r.CompareTo(l));
        var ans = new List<int>();
        foreach (var o in odd)
        {
            for (var i = 0; i < o; ++i) ans.Add(i % 2);
        }
        for (var i = 0; i < (even.Count + 1) / 2; ++i)
        {
            for (var j = 0; j < even[i]; ++j) ans.Add(j % 2);
            if (i < even.Count - 1 - i) for (var j = 0; j < even[even.Count - 1 - i]; ++j) ans.Add(1 - j % 2);
        }
        WriteLine(string.Concat(ans));
    }
}