output_description: Print the base -2 representation of N.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def sigma4jou(k):
      total = 0
      for i in range(k):
          total += 4 ** (i)
      return total
  
  
  def pketa(N):
      k = 1
      while N - sigma4jou(k) > 0:
          k += 1
      return 2 * k - 1
  
  
  def mketa(N):
      k = 1
      while N + 2 * sigma4jou(k) < 0:
          k += 1
      return 2 * k
  
  
  def getResult(N):
      result = ""
      if N == 0:
          result += "0"
      elif N > 0:
          k = pketa(N)
          for i in range(k, 0, -2):
              j = int((i + 1) / 2)
              if abs((sigma4jou(j) - N) // (2 ** (i - 1))) % 2 == 0:
                  result += "1"
              else:
                  result += "0"
              if i > 1:
                  if abs(((sigma4jou(j) - N)) // (2 ** (i - 2))) % 2 == 1:
                      result += "1"
                  else:
                      result += "0"
      elif N < 0:
          k = mketa(N)
          for i in range(k, 0, -2):
              j = int(i / 2)
              if abs((N + 2 * sigma4jou(j)) // (2 ** (i - 1))) % 2 == 0:
                  result += "1"
              else:
                  result += "0"
              if i > 1:
                  if abs(((N + 2 * sigma4jou(j))) // (2 ** (i - 2))) % 2 == 1:
                      result += "1"
                  else:
                      result += "0"
      return result
  
  
  N = input()
  print(getResult(N))
  
problem_description: Statement
  
  Given an integer N, find the base -2 representation of N.
  
  Here, S is the base -2 representation of N when the following are all
  satisfied:
  
    * S is a string consisting of `0` and `1`.
    * Unless S = `0`, the initial character of S is `1`.
    * Let S = S_k S_{k-1} ... S_0, then S_0 \times (-2)^0 + S_1 \times (-2)^1 + ... + S_k \times (-2)^k = N.
  
  It can be proved that, for any integer M, the base -2 representation of M is
  uniquely determined.
samples: [{"input": "-9", "output": "1011\n    \n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, `1011` is the base -2\nrepresentation of -9.\n\n* * *"}, {"input": "123456789", "output": "11000101011001101110100010101\n    \n\n* * *"}, {"input": "0", "output": "0"}]