Stone Game

The stone game is a game for two players.

There are $N$ stones on a table. Sanggeun and Changyoung take stones in alternating turns, and a player can take 1 stone or 3 stones per turn. 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, or CY if Changyoung wins.