1225 - Palindromic Numbers (II)

/*****************************************************************
 *                                    *
 *          protick kumer dey                                   *
 *          JU-CSE-22
            perseus_cilix                                            *
 *                                                   *
 *****************************************************************/

#include<algorithm>
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<cstring>
#include<map>
#include<iterator>
#include<deque>
#include<climits>
#include<complex>

#define S scanf
#define p  printf

#define LL long long int
#define ULL unsigned long long int
#define D double
#define pi acos(-1)
#define Max(a,b)    (a>b?a:b)
#define Min(a,b)    (a<b?a:b)
#define _Max(a,b,c) Max(a,Max(b,c))
#define _Min(a,b,c) Min(a,Min(b,c))
#define SQR(n)      (n*n)
#define NL         printf("\n");
#define fl(i,a,b) for(int i=a;i<=b;i++)
#define rfl(i,a,b) for(int i=b;i>=a;i--)
#define sfl(i,n) for(int i=0;i<n;i++)
#define rsfl(i,n) for(int i=n-1;i>=0;i--)
#define MEM(array,value) memset(array,value,sizeof(array));

int revers(int n)
{
    int arr[1000], c, a, b, i = 0, j;
    while(n > 0)
    {
        arr[i] = n % 10;
        n = n / 10;
        i++;
    }
    b = 1, c = 0;
    rsfl(j, i)
    {
        c += arr[j] * b;
        b *= 10;
    }

    return c;
}
using namespace std;
int main()
{
    int t;
    int n, a, b, i;
    cin >> t;
    sfl(i, t)
    {
        cin >> n;
        b = revers(n);
        if(n == b)
        {
            cout << "Case " << i + 1 << ": Yes" << endl;
        }
        else
            cout << "Case " << i + 1 << ": No" << endl;
    }


    return 0;
}