output_description: Print the minimum possible (absolute) difference between the largest number of
  crackers received by a user and the smallest number received by a user.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: n = int(input())
  
  a = []
  
  if n > 0:
      while n > 0:
          a.append(n % 2)
          n //= 2
  
      a.append(0)
      a.append(0)
      for i in range(len(a) - 1):
          if i % 2 == 1:
              if a[i] == 1:
                  a[i + 1] += 1
              elif a[i] == 2:
                  a[i + 1] += 1
                  a[i] = 0
          else:
              if a[i] == 2:
                  a[i + 1] += 1
                  a[i] = 0
          a[i] = str(a[i])
  
      for i in range(len(a) - 1, -1, -1):
          if a[i] == 0 or a[i] == "0":
              a[i] = ""
          else:
              break
      print("".join(reversed(a)))
  elif n == 0:
      print("0")
  else:
      n = 0 - n
      while n > 0:
          a.append(n % 2)
          n //= 2
  
      a.append(0)
      a.append(0)
      for i in range(len(a) - 1):
          if i % 2 != 1:
              if a[i] == 1:
                  a[i + 1] += 1
              elif a[i] == 2:
                  a[i + 1] += 1
                  a[i] = 0
          else:
              if a[i] == 2:
                  a[i + 1] += 1
                  a[i] = 0
          a[i] = str(a[i])
  
      for i in range(len(a) - 1, -1, -1):
          if a[i] == 0 or a[i] == "0":
              a[i] = ""
          else:
              break
      print("".join(reversed(a)))
  
problem_description: Statement
  
  Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly
  as possible. When all the crackers are distributed, find the minimum possible
  (absolute) difference between the largest number of crackers received by a
  user and the smallest number received by a user.
samples: [{"input": "7 3", "output": "1\n    \n\nWhen the users receive two, two and three crackers, respectively, the\n(absolute) difference between the largest number of crackers received by a\nuser and the smallest number received by a user, is 1.\n\n* * *"}, {"input": "100 10", "output": "0\n    \n\nThe crackers can be distributed evenly.\n\n* * *"}, {"input": "1 1", "output": "0"}]