output_description: Print the base -2 representation of N.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: a=int(input())
  sum=0
  s=''
  '''if a<0:
      b = abs(a)
      if b%2==1:
          b=b+1
          print(str(bin(b))[2:-1]+'1')
      else:
          print(str(bin(b))[2:-1])''
  if a!=0:
      while(a!=1):
          if a%(-2)==-1:
              s=s+'1'
              a=a-1
              a=a/-2
          else:
              s = s + '0'
              a=a/-2
      s=s+'1'
      for i in range(len(s)):
          print(s[len(s)-1-i],end='')
      print()
  else:
      print(0)
  
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"}]