B'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 0. Kolya remembers that at the beginning of the game his game-coin score was equal to n and that he have bought only some houses (for 1 xe2 x80 x89234 xe2 x80 x89567 game-coins each), cars (for 123 xe2 x80 x89456 game-coins each) and computers (for 1 xe2 x80 x89234 game-coins each). Kolya is now interested, whether he could have spent all of his initial n 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 a, b and c such that a xe2 x80 x89 xc3 x97 xe2 x80 x891 xe2 x80 x89234 xe2 x80 x89567 xe2 x80 x89+ xe2 x80 x89b xe2 x80 x89 xc3 x97 xe2 x80 x89123 xe2 x80 x89456 xe2 x80 x89+ xe2 x80 x89c xe2 x80 x89 xc3 x97 xe2 x80 x891 xe2 x80 x89234 xe2 x80 x89= xe2 x80 x89n? Please help Kolya answer this question. The first line of the input contains a single integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- Kolya 's initial game-coin score. Print "YES" (without quotes) if it 's possible that Kolya spent all of his initial n coins buying only houses, cars and computers. Otherwise print "NO" (without quotes). In the first sample, one of the possible solutions is to buy one house, one car and one computer, spending 1 xe2 x80 x89234 xe2 x80 x89567 xe2 x80 x89+ xe2 x80 x89123 xe2 x80 x89456 xe2 x80 x89+ xe2 x80 x891234 xe2 x80 x89= xe2 x80 x891 xe2 x80 x89359 xe2 x80 x89257 game-coins in total. '...