+ محدودیت زمان: ۱ ثانیه + محدودیت حافظه: ۲۵۶ مگابایت --- Sara wants to entertain her niece with $n$ coins she has in her pocket. To do this, she arranges a game. In this game, several coins should initially be placed on the table. Then, in each turn, a player must remove either $1$ or exactly $4$ coins from the table and pass the turn to the other player. The winner is the person who takes the last coin or coins. Sara, due to her love for her niece, allows her niece to start the game. Help Sara determine whether she can definitely win the game by placing all her coins on the table or not. # ورودی The input consists of a single integer $n$ $(1 \leq n \leq 10^{18})$, which represents the number of coins Sara has. # خروجی In the only line of output, print `Yes` if Sara has a guaranteed winning strategy, and `No` otherwise. ## ورودی نمونه 1 ``` 1 ``` ## خروجی نمونه 1 ``` No ``` ## ورودی نمونه 2 ``` 2 ``` ## خروجی نمونه 2 ``` Yes ```