Encoding

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 100.

Output

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

Sample Input

2
ABC
ABBCCC

Sample Output

ABC
A2B3C

Source

ZHANG, Zheng

#include <stdio.h>
#include<string.h>
#include <stdlib.h>


int main()
{
    int t,len,i,count;
        char ch[110];
    while(~scanf("%d",&t))
    {
        while(t--)
        {
                        scanf("%s",ch);
            len=strlen(ch);
                        i=0;
            while(i<len)
            {
                                count=1;
                i+=1;

                if(ch[i-1]==ch[i]&&i<len)
                {
                                        while(ch[i-1]==ch[i])
                    {
                                                i++;
                                                count++;
                                        }
                    printf("%d",count);
                    printf("%c",ch[i-1]);
                }
                else
                    printf("%c",ch[i-1]);
                }
                puts("");
                }
      }
      return 0;
}