import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 3 * 10^^5 + 10;

void main() {
  auto dp = new int[LIM];
  dp[] = LIM;
  dp[0] = 0;
  foreach (n; 1 .. LIM) {
    for (int k = 1; k^^2 <= n; ++k) {
      chmin(dp[n], dp[n - k^^2] + k);
    }
  }
  debug {
    writeln("max dp = ", dp.maxElement);
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      
      const L = dp[N];
      debug {
        writeln("L = ", L);
      }
      string ans;
      int now = N, last = 1, k = 0;
      foreach (i; 0 .. L) {
        // check 0
        int c;
        if (last == 0) {
          const n = now - k^^2;
          if (n >= 0 && i + dp[n] <= L) {
            c = 0;
          } else {
            c = 1;
          }
        } else {
          c = 1;
          foreach (j; i + 1 .. L + 1) {
            const n = now - (k + (j - i))^^2;
            if (n >= 0 && j + dp[n] <= L) {
              c = 0;
            }
          }
        }
        ans ~= cast(char)('0' + c);
        if (last == c) {
          now -= k^^2;
          k = 1;
        } else {
          last = c;
          ++k;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}