uva problem 13216 Problem with a ridiculously solution

#include<bits/stdc++.h>
#include<string.h>
#include<cmath>
int main()
{
     int t,ln,n,j;
    char str[5001];
  scanf("%d", &t);
    while(t--)
    {
         long long int ans=1,i;
        scanf("%s", str);
         ln=strlen(str);
        if(strlen(str)==1 && str[0]=='0') printf("1\n");
        else if( strlen(str) ==1 && str[0]=='1') printf("66\n");
        else {
            i= str[ln-1]-'0';
            i=i%5;
            switch(i)
            {
            case 0:
                printf("76\n");
                break;
            case 1:
                printf("16\n");
                break;
            case 2:
                printf("56\n");
                break;
            case 3:
                printf("96\n");
                break;
            case 4:
                printf("36\n");
                break;

            }
        }
    }
    return 0;
}