Stone Game 6

Interview

Time limit1sMemory limit128 MB

Summary

Two players alternately take 1, 3, or 4 stones from a pile of N, and the program prints which player wins with perfect play.

Level: Easy3 of 10
Topics: Game theory, Dynamic programming
Solved: No attempts yet

Problem

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.

Input

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

Output

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

Examples1

Example 1
Input
```
6
```
Expected output
```
SK
```