#include <stdio.h>
#include <string.h>
//Brian Kernighan 算法
int count_binary(int n);
int main() {
int t;
scanf("%d",&t);
getchar();
for(int i = 0;i < t;i++){
char str[502];
scanf("%s",str);
int len = strlen(str);
for(int j = 0;j < len;j++){
if(count_binary(j+1)%2==1) str[j] = str[j]-'a'+'A';
}
printf("%s\n",str);
}
return 0;
}
int count_binary(int n){
int count = 0;
while(n > 0){
n = n & n-1;
count++;
}
return count;
}

京公网安备 11010502036488号