#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <algorithm>using namespace std;#define ls 2*i#define rs 2*i+1#define up(i,x,y) for(i=x;i<=y;i++)#define down(i,x,y) for(i=x;i>=y;i--)#define mem(a,x) memset(a,x,sizeof(a))#define w(a) while(a)#define LL long longconst double pi = acos(-1.0);#define Len 100005#define mod 1000000007int t,n,a[105];int main(){ int i; scanf("%d",&t); w(t--) { scanf("%d",&n); up(i,0,n-1) { scanf("%d",&a[i]); } sort(a,a+n); if(a[0]==a[1]) printf("%dn",a[n-1]); else printf("%dn",a[0]); } return 0;}
