#include<stdio.h>

strsort(char s[], int length)
{

  char tmp;
  int i, j;
  for(i=0; i<length-2; i=i+2)
  {
		for (j=i+2; j<length; j=j+2)
		{
			 if (s[i] > s[j])
			 {
				 tmp=s[i];
				 s[i]=s[j];
				 s[j]=tmp;
			 }
		}
  }

  for(i=1; i<length-3; i=i+2)
  {
		for (j=i+2; j<length-1; j=j+2)
		{
			 if (s[i] > s[j])
			 {
				 tmp=s[i];
				 s[i]=s[j];
				 s[j]=tmp;
			 }
		}
  }
}

int main()
{

  int N;
  scanf("%d",&N);
  int I=0;
  int charCount[26];
  int i=0;
  int n;
	char x[212];
	char V[] = {'A', 'U', 'E', 'O', 'I'};
	char C[] = {'J', 'S', 'B', 'K', 'T', 'C', 'L', 'D', 'M', 'V', 'N', 'W', 'F', 'X', 'G', 'P', 'Y', 'H', 'Q', 'Z', 'R'};

	int vc, cc;
	int t=1;


  for(I=0;I<N;I++)
  {
		scanf("%d", &n);
		i=0;
		for(i=0;i<26;i++)
		{
			if((i + 'A' -'A')==0 || (i + 'A' -'E')==0 || (i + 'A' -'I')==0 || (i + 'A' -'O')==0 || (i + 'A' -'U')==0)
			{
					charCount[i] = 21;
			}
			else
					charCount[i] = 5;
		}

	  int count = 0;
		vc = 0;
		cc = 0;
		t=1;
		printf("Case %d:",I+1);
		for(i=0;i<n;i++)
		{
			if(t==1)
			{
					x[count++] = V[vc];
					charCount[V[vc]-'A']--;
					if(charCount[V[vc]-'A']==0)
						vc++;
					t = t * -1;
			}
			else
			{
					x[count++] = C[cc];
					charCount[C[cc]-'A']--;
					if(charCount[C[cc]-'A']==0)
						cc++;
					t = t * -1;
			}
		}
		x[count] = '\0';
		strsort(x, count);
		printf("%s \n", x);
	}
  return 0;
}