Div 1 Problem C

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cctype>
#include<map>
#include<stack>
#include<cstdlib>
#include <queue>
#include <vector>
#include<algorithm>
#include<iostream>
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main()
{
    int n,no=0;
    while(sc("%d",&n)==1)
    {
        if(n==0)
        break;
        if(n%6==1)
        pf("Case %d: Anjan\n",++no);
        else if(n%6==2)
        pf("Case %d: Sufian\n",++no);
        else if(n%6==3)
        pf("Case %d: Alim\n",++no);
        else if(n%6==4)
        pf("Case %d: Shipu\n",++no);
        else if(n%6==5)
        pf("Case %d: Sohel\n",++no);
        else if(n%6==0)
        pf("Case %d: Sumon\n",++no);
    }
    return 0;
}