#include using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N; ll D[101010]; ll X,Y; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; FOR(i,N) cin>>D[i]; cin>>x>>y; int d=(abs(x)+abs(y))%2; X=abs(x+y); Y=abs(x-y); sort(D,D+N); int mi=3; if(x==0 && y==0) mi=0; ll P[2]={-1,-1}; FOR(i,N) { if(D[i]==max(X,Y)) mi=min(mi,1); ll c=P[d^(D[i]%2)]; if(c>=0) { if((D[i]-c)<=Y && Y<=(D[i]+c) && (D[i]-c)<=X && X<=(D[i]+c)) mi=min(mi,2); } P[D[i]%2]=D[i]; } if(mi==3) mi=-1; assert(mi!=-1); cout<