#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
#include<set>
#include<cstring>
using namespace std;
#define maxn 100010
int main()
{
int t;
scanf("%d",&t);
int Case=0;
while(t--)
{
int n;
scanf("%d",&n);
int x1,y1,z1,x2,y2,z2;
x1=n;
y1=n;
x2=y2=z1=z2=0;
Case++;
printf("Case #%d: %d %d %d %d %d %d\n",Case,x1,x2,y1,y2,z1,z2);
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
#include<set>
#include<cstring>
using namespace std;
#define maxn 100010
int main()
{
string str1,str2;
while(getline(cin,str1))
{
getline(cin,str2);
string str=str1;
int len=str1.size();
if(str1>str2)
swap(str1,str2);
int k=len-1;
while(str1[k]+1>'Z')
{
str1[k]='A';
k--;
}
str1[k]++;
cout<<str1<<endl;
}
return 0;
}