Increasing Sequence

Given a sequence $a\_{1}, a\_{2}, \ldots, a\_{n}$, a sequence $b\_{1}, b\_{2}, \ldots, b\_{n}$ is called a good sequence if it satisfies the following conditions:

• $b\_{i}$ is a positive integer ($i = 1, 2, \ldots, n$).
• $b\_{i} \neq a\_{i}$ ($i = 1, 2, \ldots, n$).
• $b\_{1} < b\_{2} < \ldots < b\_{n}$.

Find the minimum possible value of $b\_{n}$ over all good sequences $b\_{1}, b\_{2}, \ldots, b\_{n}$.

Each input consists of multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). Each test case follows on the next lines.

The first line of each test case contains an integer $n$ ($1 \le n \le 100$).

The second line contains $n$ integers $a\_1, a\_2, \ldots, a\_n$ separated by spaces ($1 \le a\_i \le 10^{9}$).

For each test case, print the answer.

In the first test case, $b = [2, 4, 5, 7, 8]$ is a good sequence. It can be proven that no good sequence $b$ has $b\_{5} < 8$. In the second test case, $b = [1, 2, 3, 4]$ is possible. In the third test case, $b = [2]$ is possible.