B'You are given a binary string s . You have to cut it into any number of non-intersecting substrings, so that the sum of binary integers denoted by these substrings is a power of 2. Each element of s should be in exactly one substring. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^5 ). Description of the test cases follows. Each test case contains a binary string s ( 1 <= |s| <= 10^6 ). It is guaranteed that the sum of |s| over all test cases does not exceed 10^6 . For each test case output the answer to the problem as follows: If there are multiple valid solutions, you can output any of them. In the first test case it is impossible to cut the string into substrings, so that the sum is a power of 2. In the second test case such cut is valid: '...