Stone Game 6

The stone game is a fun game for two players.

There are $N$ stones on a table. Sanggeun and Changyoung take turns removing stones, and on each turn a player can take 1, 3, or 4 stones. The player who takes the last stone wins the game.

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

The first line contains the number of stones $N$. ($1 \le N \le 10^{12}$)

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