#include using namespace std; #define sort(s) sort(s.begin(),s.end()) #define rsort(s) sort(s.rbegin(),s.rend()) #define scani1(n) scanf("%d",&(n)) #define scani2(n,m) scanf("%d %d",&(n),&(m)) #define scani3(n,m,k) scanf("%d %d %d",&(n),&(m),&(k)) #define scanl1(n) scanf("%lld",&(n)) #define scanl2(n,m) scanf("%lld %lld",&(n),&(m)) #define scanl3(n,m,k) scanf("%lld %lld %lld",&(n),&(m),&(k)) #define scans(x) scanf("%s",x) #define gin(a) getline(cin,a) #define cases int T; scanl1(T); while(T--) #define pi 3.1415926535897932384626433832795l #define Ignore cin.ignore(); #define mem(n,i) memset(n,i,sizeof n); #define precision(n) cout< "< "< "< inline T binary_decimal(T n){ll decimal=0, i=0, rem;while (n!=0){rem = n%10;n/=10;decimal += rem*pow(2,i);++i;}return decimal;} template inline T LCM(T a,T b){return (a*b)/GCD(a,b);} template inline T GCD(T a,T b) {ll t;while(a){t = a;a = b%a;b = t;}return b;} template inline T Pow(T base,T exp){ll result = 1;while (exp){if(exp&1)result*=base;exp>>=1;base*=base;}return result;} int main() { cases{ int n,i; cin>>n; long long x[n]; for(i=0;i