sicily 1028 Hanoi Tower Sequence

#include <bits/stdc++.h>

using namespace std;

int a[250];

int cal(int a[],int n) {
    int cnt=1;
    while (a[n-1]%2==0) {
        cnt++;
        for (int i=0,temp=0;i<n;i++) {
            temp=temp*10+a[i];
            a[i]=temp/2;
            temp%=2;
        }
    }
    return cnt;
}

int main()
{
    int t;
    cin >> t;
    int count=0;
    while(t--)
    {
        string s;
        cin >> s;
        int len = s.size();
        for(int i=0; i<len; i++)
            a[i] = s[i]-'0';
        cout << "Case " << ++count << ": ";
            
        cout << cal(a, len) << endl;
        if(t != 0)
            cout << endl;
    }
    return 0;
}