Encoding

Problem Description

Given a string containing only 'A' - 'Z', we could encode it using the following method: 

1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.

2. If the length of the sub-string is 1, '1' should be ignored.

Input

The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.

Output

For each test case, output the encoded string in a line.

Sample Input

2

ABC

ABBCCC

Sample Output

ABC

A2B3C

#include <stdio.h>
#include <string.h>
 
int main(){
    int N;
    char A_Z[10001];
    int i;
    int length;
    char flag;
    int amount;
     
    scanf("%d",&N);
     
    while(N--){
        scanf("%s",A_Z);
        length=strlen(A_Z);
         
        flag=A_Z[0];
        amount=1;
        for(i=1;i<length;i++){  
            if(flag==A_Z[i]){
                amount++;
                 
                if(i==length-1){
                    if(amount==1)
                        printf("%c",flag);
                     
                    else
                        printf("%d%c",amount,flag);
                }
            }
                 
            else{
                if(amount==1)
                    printf("%c",flag);
                     
                else
                    printf("%d%c",amount,flag);
                     
                if(i==length-1)
                    printf("%c",A_Z[i]);
                     
                amount=1;
                flag=A_Z[i];
            }
        }
         
        printf("
");
         
    }
    return 0;
}