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: import sys
  
  MAX_INT = int(10e15)
  MIN_INT = -MAX_INT
  mod = 1000000007
  sys.setrecursionlimit(1000000)
  
  
  def IL():
      return list(map(int, input().split()))
  
  
  def SL():
      return input().split()
  
  
  def I():
      return int(sys.stdin.readline())
  
  
  def S():
      return input()
  
  
  N = I()
  a = [100, 101, 102, 103, 104, 105]
  dp = [[False] * (N + 1) for i in range(6 + 1)]
  dp[0][0] = True
  
  for i in range(1, 6 + 1):
      for j in range(N + 1):
          if 0 <= (j - a[i - 1]) < N + 1:
              if dp[i - 1][j - a[i - 1]] == True:
                  dp[i][j] = True
          if dp[i - 1][j] == True:
              dp[i][j] = True
  print(int(dp[-1][-1]))
  
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."}]