Given a binary input that represents binary representation of whole number n, the task is to find binary representation of n+1.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a binary representation of whole number.
For each test case, print the binary representation of number n+1.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.