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

#include<istream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int T;
    char s1[1001];
    scanf("%d",&T);
    while(T--)
	{
        scanf("%s",s1);
        int ans = 1;
        int len = strlen(s1);
        for(int i = 0; i < len; i++)
		{
            if(s1[i] == s1[i+1])
                ans++;
            else 
			{
                if(ans == 1)
				   printf("%c",s1[i]);
                else 
				{
                   	printf("%d%c",ans,s1[i]);
                    ans = 1;
                }
            }
        }
        printf("\n");
    }
    return 0;
}