F - A Missing Problem in TCPC2017 （SDUT 2018 Autumn Individual Contest - F）

滴答滴答---题目链接 

While the judges of TCPC were busy preparing the problems, they encountered a strange problem. One of the problems was missing !!

The judges remember that they prepared exactly N problems and that they were numbered from 1 to N. They also remembered that the problems were sorted according to their number.

The judges started investigating but they realized that they don't have enough time, so they asked the contestants for help.

Input

The first line contains a single integer T, the number of test cases.

The first line of each test case consists of a single integer N (2 ≤ N ≤ 12), denoting the number of problems.

The second line of each test case contains N - 1 space separated integer denoting the number of each problem the judges didn't miss. Yet!

it's guaranteed that the numbers are given in the increasing order.

Output

For each test case print a single line, containing a single integer, denoting the number of the missing problem.

Example

Input

1
4
1 2 4

Output

3

#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

int main()
{
    int t;
scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int a[101];
        memset(a,0,sizeof(a));
        for(int i=1;i<n;i++)
            {
                int x;
                scanf("%d",&x);
                a[x]++;
            }
            int ans;
        for(int i=1;i<=n;i++)
        {if(!a[i])
        {
            ans=i;break;
        }

        }
        printf("%d\n",ans);
    }
    return 0;
}