atcoder#SUMITB2019C. 100 to 105

100 to 105

Score: 300300 points

Problem Statement

AtCoder Mart sells 10000001000000 of each of the six items below:

  • Riceballs, priced at 100100 yen (the currency of Japan) each
  • Sandwiches, priced at 101101 yen each
  • Cookies, priced at 102102 yen each
  • Cakes, priced at 103103 yen each
  • Candies, priced at 104104 yen each
  • Computers, priced at 105105 yen each

Takahashi wants to buy some of them that cost exactly XX yen in total. Determine whether this is possible. (Ignore consumption tax.)

Constraints

  • 1X1000001 \leq X \leq 100000
  • XX is an integer.

Input

Input is given from Standard Input in the following format:

XX

Output

If it is possible to buy some set of items that cost exactly XX yen in total, print 1; otherwise, print 0.

615
1

For example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615100+101+102+103+104+105=615 yen in total.

217
0

No set of items costs 217217 yen in total.