Given a pattern as below and an integer n your task is to decode it and print nth row of it. The pattern follows as :
1
11
21
1211
111221
............
Input:
The first line of input is the number of test cases . Then T test cases follow . The first line of each test case is an integer N.
Output:
For each test case print the required nth row of the pattern.
Constraints:
1<=T<=20
1<=N<=20
Example:
Input:
2
2
3
Output:
11
21
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.
| mr_kksparrow | 433 |
| manvirag982 | 272 |
| snow_den_ | 236 |
| arpit_anshuman | 228 |
| Exception_404 | 220 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |