Given a number, remove recurring digits from it. All adjacent same occurrences of a digit should be replaced by only 1 digit. For example, 111222 should be converted to 12.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N.
Print the number of remving recurring digits
1 ≤ T ≤ 30
1 ≤ N < 10^30