signed main()
{
    t=re(),id=re();
	while(t--)
    {
    	int n=re();
    	int vis=0;
        minn1[0]=minn2[n+1]=0x7fffffff;
        maxx1[0]=maxx2[n+1]=-0x7fffffff;
    	for(int i=1;i<=n;i++)
    		a[i]=re();
        sort(a+1,a+n+1);
		for(int i=1;i<n;i++)
    	{
    		minn1[i]=min(minn1[i-1],a[i]);
    		maxx1[i]=max(maxx1[i-1],a[i]);
    		ran1[i]=maxx1[i]-minn1[i];
		}
		for(int i=n;i>1;i--)
		{
			minn2[i]=min(minn2[i+1],a[i]);
			maxx2[i]=max(maxx2[i+1],a[i]);
			ran2[i]=maxx2[i]-minn2[i];
		}
		for(int i=2;i<n;i++)
		{
			if(ran1[i]==ran2[i+1])
			{
				vis=1;
				break;
			}
		}
		if(vis)
		    cout<<"Yes"<<endl;
		else
		    cout<<"No"<<endl;
	}
	return 0;
}