Chef vs Priyanshu

Chef and Priyanshu are very good friends . One day they decided to play a game where they will have a tree data structure and both will remove one leaf node turn by turn. This tree is acyclic as well as undirected having $N$ Nodes. There is a special node $K$. The player who removes this node wins the game. Chef moves first. Print the name of the winner if both of them play optimally. ### Inpu