Stone Game 3

The stone game is a game for two players.

There are $N$ stones on a table. Sanggeun and Changyeong take stones in alternating turns, and on one turn a player can take 1, 3, or 4 stones. The player who takes the last stone wins.

Write a program that finds the winner when both players play perfectly. Sanggeun starts the game.

The first line contains $N$. ($1 \le N \le 1000$)

Print SK if Sanggeun wins the game, or CY if Changyeong wins the game.