Problem Description

Today is May 8^th, the mother’s day. At first let’s bless Mother’s Day to the mothers of the world with our most respect.
What’s more, it’s maybe a more significant day for at least one person, and maybe the happiest, the most wonderful, the most memorable, the most splendid, the most fantastic… for her, Stefanie, from Singapore, the favorite singer of iSea.
With white pure dress, with the music of Mendelssohn, with the red carpet, with the focus of all others’ sight, with the lover on today and forever, she is on the way to another new start of her life, beginning with the wedding.
So, don’t be stingy, let’s give the best blessing for her. Your program’s output should begin with “Best wishes to Stefanie”. As a faithful fan, to show more sincere blessing, iSea choose his favorite TOPTEN songs:

1.Yu Jian
2.Tin O O
3.I Missed
4.Stefanie
5.The Same
6.About
7.Honey Honey
8.Unfinished
9.Hey Jude
10.When Winter Fades

iSea will listen to these songs alternately and circularly, i.e. one after one and after the last one beginning from the first one again from tomorrow, May 9^th 2011. He will listen to exactly one song for one day, except the weekends, Saturday and Sunday, when he will play SanGuoSha and DotA Games. Being addicted in those fairs, he wants to ask you which song he should hear today.

Input

The first line contains a single integer T, indicating the number of test cases.
Each test case begins with only one integers N, means N day(s) after today. You can assume the day won’t be weekends and in the range of 32-bit integer.

Output

Print “Best wishes to Stefanie” at the first line, and then a blank line.
Then for each test case, output the Song Name of this day.

3
1
3
5

Best wishes to Stefanie

Yu Jian
I Missed
The Same

Author

iSea@WHU