DAYOFPAY - Day of Pay

Anjan, Sufian, Alim, Shipu, Sohel & Sumon are good friends. Every day they meet in a hotel. There they eat something but when it is time to pay the bill they become silent, nobody talks to each other because nobody want to pay the bill. Every day they quarrel for this reason. One day they decided paying bill for a sequence:

Anjan → Sufian → Alim → Shipu → Sohel → Sumon

With this sequence they pay bill in a particular month.

Input

Each test case contains an integer n (0 ≤ n ≤ 31) that indicates the day. The input terminated when n = 0.

Output

For each case, print the case number and print the name who pay the bill for that day.

Example

Input:
1
3
5
6
4
0

Output:
Case 1: Anjan
Case 2: Alim
Case 3: Sohel
Case 4: Sumon
Case 5: Shipu

___________________________________________________________________________________________________________
Problem Setter: Shipu Ahamed, Dept. of CSE

Bangladesh University of Business and Technology (BUBT)


Added by:Shipu Ahamed
Date:2013-03-06
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64

hide comments
2018-02-07 16:07:14
easy one
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.