Stone Game

Interview

Time limit1sMemory limit128 MB

Summary

Two players alternately take 1 or 3 stones from a pile of N, and the program names the winner under perfect play.

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

Problem

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.

Input

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

Output

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

Examples1

Example 1
Input
```
5
```
Expected output
```
SK
```