枚舉題，枚舉長寬刷過去就對了
//====================================================================||
// Name : Bob’s Beautiful Balls.cpp ||
// Date : Jun 6, 2013 9:11:33 AM ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 10011
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int len;
char str\[1000\];
char mz\[60\]\[60\];
bool check(int w,int h){
Set(mz,0);
mz\[0\]\[0\]=str\[0\];
int now=0;
int k=1;
int x=1,y=0;
for(;k<len;k++){
if(now==0){
mz\[x\]\[y\]=str\[k\];
if(x+1>=w||mz\[x+1\]\[y\]!=0){
now=1;
y++;
continue;
}
x++;
}else if(now==1){
mz\[x\]\[y\]=str\[k\];
if(y+1>=h||mz\[x\]\[y+1\]!=0){
now=2;
x--;
continue;
}
y++;
}else if(now==2){
mz\[x\]\[y\]=str\[k\];
if(x-1<0||mz\[x-1\]\[y\]!=0){
now=3;
y--;
continue;
}
x--;
}else if(now==3){
mz\[x\]\[y\]=str\[k\];
if(y-1<0||mz\[x\]\[y-1\]!=0){
now=0;
x++;
continue;
}
y--;
}
}
// for(int i=0;i<h;i++){
// for(int j=0;j<w;j++)printf("%c",mz\[j\]\[i\]);
// Pln();
//
// }
for(int i=0;i<w;i++){
for(int j=1;j<h;j++){
if(mz\[i\]\[j\]!=mz\[i\]\[0\])return false;
}
}
return true;
}
void solve(){
int minans=oo;
for(int i=sqrt(len);i>1;i--){
if((len%i)==0){
bool b=check(len/i,i)||check(i,len/i);
if(b)minans=min(minans,len/i+i);
}
}
if(minans==oo)minans=-1;
printf("%d\\n",minans);
}
int main() {
ios\_base::sync\_with\_stdio(0);
int test;
int ff=0;
scanf("%d",&test);
while(test--){
scanf("%s",str);
len=strlen(str);
printf("Case %d: ",++ff);
solve();
}
}