+ محدودیت زمان: ۱ ثانیه + محدودیت حافظه: ۲۵۶ مگابایت ---------- After burning down their own house, Pat & Mat decided to play a game in order to forget their misery. The rules of the game are simple. There are $N$ stones on the table. Pat & Mat play alternatively. Pat plays first. At each turn, they can either remove $1$ or $2$ or $3$ or $4$ or $5$ or $6$ stones from the table. The player who can't perform any legal move in his turn, will lose the game. Given the number $N$, determine which of the brothers will win the game if they play optimally. # ورودی The input consists of a single integer $N$ denoting the number of stones. $$1 \leq N \leq 10^6$$ # خروجی Print the name of the winner in a single line. # مثال‌ها ## ورودی نمونه ۱ ``` 6 ``` ## خروجی نمونه ۱ ``` Pat ``` ## ورودی نمونه ۲ ``` 2233 ``` ## خروجی نمونه ۲ ``` Mat ```