def a(i)
  return 0 if i < 100
  return 0 if i > 100000
  1.upto(i.div(100)) do |n|
    [100, 101, 102, 103, 104, 105].repeated_combination(n) do |c|
      return 1 if i == c.sum
    end
  end
  0
end

p a(gets.to_i)