Nyoj-rock (7)

Stone (7) Time Limit: 1000 MS | memory limit: 65535 kb difficulty: 1

Description

Yougth and hrdv play a game and place n stones in a circle. yougth and hrdv take stones from them respectively. Who wins first? One or two adjacent stones can be obtained from each game, hrdv gets the name of the Victory first.

Input

The input includes multiple groups of test data.
Each group of test data is N, and the data is within the int range.

Output

Output the name of the winner.

Sample Input

23

Sample output

HrdvYougth

Source

Poj

Code:

#include<stdio.h>int main(){int n;while(~scanf("%d",&n)){if(n<3)printf("Hrdv\n");elseprintf("Yougth\n");}return 0;}

Nyoj-rock (7)