Count and Say Sequence Problem

The 'Count and Say' sequence is a series of strings in which each consecutive term is generated by describing the previous term. The sequence begins with '1'.

Your task is to determine the sequence after N iterations given a positive integer N.

Example:

Iterations:

1. "1"
2. "11" ('one 1')
3. "21" ('two 1')
4. "1211" ('one 2, one 1')
5. "111221" ('one 1, one 2, two 1')
6. "312211" ('three 1, two 2, one 1')

Input:

T
N1
N2
...
NT

Output:

Sequence after N1 iterations
Sequence after N2 iterations
...
Sequence after NT iterations

Example:

Input:

2
1
4

Output:

1
1211

Constraints:

• 1 <= T <= 10
• 1 <= N <= 30

Note:

You don't have to print anything, it has already been taken care of. Just implement the given function.