Given a number N, find the number of binary strings of length N that contains consecutive 1's in them.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow.
The first line of each test case contains a positve integer N, denoting the length of the binary string.
Print out the count of strings having consecutive 1's in them.
1 <= T <= 200
2 <= N <=30
In the above first testcase there are 4 strings of length 2, the strings are 00, 01, 10 and 11. Only the string 11 has consecutive 1's.
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.