output_description: If it is possible to buy some set of items that cost exactly X yen in total,
  print `1`; otherwise, print `0`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X
attempt: x = int(input())
  total = 0
  if x % 10 == 9:
      total += 104 + 105
  elif x % 10 == 8:
      total += 104 + 104
  elif x % 10 == 7:
      total += 103 + 104
  elif x % 10 == 6:
      total += 105 + 101
  elif x % 10 == 5:
      total += 105
  elif x % 10 == 4:
      total += 104
  elif x % 10 == 3:
      total += 103
  elif x % 10 == 2:
      total += 102
  elif x % 10 == 1:
      total += 101
  
  if x % 100 // 10 == 1:
      total += 105 + 105
  elif x % 100 // 10 == 2:
      total += 105 * 4
  elif x % 100 // 10 == 3:
      total += 105 * 6
  elif x % 100 // 10 == 4:
      total += 105 * 8
  elif x % 100 // 10 == 5:
      total += 105 * 10
  elif x % 100 // 10 == 6:
      total += 105 * 12
  elif x % 100 // 10 == 7:
      total += 105 * 14
  elif x % 100 // 10 == 8:
      total += 105 * 16
  elif x % 100 // 10 == 9:
      total += 105 * 18
  
  if total <= x:
      print(1)
  else:
      print(0)
  
problem_description: Statement
  
  AtCoder Mart sells 1000000 of each of the six items below:
  
    * Riceballs, priced at 100 yen (the currency of Japan) each
    * Sandwiches, priced at 101 yen each
    * Cookies, priced at 102 yen each
    * Cakes, priced at 103 yen each
    * Candies, priced at 104 yen each
    * Computers, priced at 105 yen each
  
  Takahashi wants to buy some of them that cost exactly X yen in total.
  Determine whether this is possible.  
  (Ignore consumption tax.)
samples: [{"input": "615", "output": "1\n    \n\nFor example, we can buy one of each kind of item, which will cost\n100+101+102+103+104+105=615 yen in total.\n\n* * *"}, {"input": "217", "output": "0\n    \n\nNo set of items costs 217 yen in total."}]