Migrated from Lutece 1519 Picking&Dancing

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Yitong_Qin and Xiaoyu_Chen are playing a game.There are $N$ stones placed on the ground,forming a sequence.Thr stones are labeled from 1 to N. Yitong_Qin and Xiaoyu_Chen in turns take exactly two consecutive stones on the ground until there are no consecutive stones on the ground.That is,each player can take stone $i$ and stone $i+1$,where $1 \leq i \leq n-1$.If the number of stones left is odd,Yitong_Qin wins ,so Xiaoyu_Chen has to dance.Otherwise Xiaoyu_Chen wins Yitong_Qin has to dance.

Input

The input contains an integer $N(1 \leq N \leq 5000)$,the number of stones.

Output

Output the guy has to dance.

Samples

1

Xiaoyu_Chen

2

Yitong_Qin

5

Xiaoyu_Chen

Resources

第八届ACM趣味程序设计竞赛第四场（正式赛）