CF681B.Economy Game

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Kolya is developing an economy simulator game. His most favourite part of the development process is in-game testing. Once he was entertained by the testing so much, that he found out his game-coin score become equal to 00 .

Kolya remembers that at the beginning of the game his game-coin score was equal to nn and that he have bought only some houses (for 12345671234567 game-coins each), cars (for 123456123456 game-coins each) and computers (for 12341234 game-coins each).

Kolya is now interested, whether he could have spent all of his initial nn game-coins buying only houses, cars and computers or there is a bug in the game. Formally, is there a triple of non-negative integers aa , bb and cc such that a×1234567+b×123456+c×1234=na×1234567+b×123456+c×1234=n ?

Please help Kolya answer this question.

输入格式

The first line of the input contains a single integer nn ( 1<=n<=1091<=n<=10^{9} ) — Kolya's initial game-coin score.

输出格式

Print "YES" (without quotes) if it's possible that Kolya spent all of his initial nn coins buying only houses, cars and computers. Otherwise print "NO" (without quotes).

输入输出样例

  • 输入#1

    1359257
    

    输出#1

    YES
  • 输入#2

    17851817
    

    输出#2

    NO

说明/提示

In the first sample, one of the possible solutions is to buy one house, one car and one computer, spending 1234567+123456+1234=13592571234567+123456+1234=1359257 game-coins in total.

首页