Given an array of size n-1 and given that there are numbers from 1 to n with one missing, the missing number is to be found.

Input:

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N,size of array.

The second line of each test case contains N-1 input C[i],numbers in array.

Output:

Print the missing number in array.

Constraints:

1 ≤ T ≤ 100

1 ≤ N ≤ 1000

1 ≤ C[i] ≤ 1000

Example:

Input

2

5

1 2 3 5

10

1 2 3 4 5 6 7 8 10

Output

4

9

MY CODE IS AS FOLLOWS:-

using namespace std;

int main() {

int number,size,b[999],d[999],a,c,e;

cin>>number;

for(int i=0;i<number;i++){

cin>>size;

for( a=1;a<=(size-1);a++){cin>>b[a];

```
}
for( c=1;c<=size;c++){
d[c]=c;
}
for(e=1;e<=size;e++){
if(d[e]!=b[e]){
cout<<d[e];
break;
}
}
}
//code
return 0;
```

}

what is wrong in this?