import java.util.*;
import java.io.*;
import java.math.*;
	//public class Hackerank2 
	public class Solution
	//public class TestClass
	//public class Main
{
	static class FastScanner
	{
        BufferedReader s;
        StringTokenizer st;
        public FastScanner(InputStream InputStream)
        {
            st = new StringTokenizer("");
            s = new BufferedReader(new InputStreamReader(InputStream));
        }
        public FastScanner(File f) throws FileNotFoundException
        {
            st = new StringTokenizer("");
            s = new BufferedReader (new FileReader(f));
        }
        public int nextInt() throws IOException
        {
            if(st.hasMoreTokens())
                return Integer.parseInt(st.nextToken());
            else{
                st = new StringTokenizer(s.readLine());
                return nextInt();
            }
        }
        public BigInteger big() throws IOException
        {
            if(st.hasMoreTokens())
                return new BigInteger(st.nextToken());
            else
            {
                st = new StringTokenizer(s.readLine());
                return big();
            }
        }
        public double nextDouble() throws IOException
        {
            if(st.hasMoreTokens())
                return Double.parseDouble(st.nextToken());
            else
            {
                st = new StringTokenizer(s.readLine());
                return nextDouble();
            }
        }
        public long nextLong() throws IOException
        {
            if(st.hasMoreTokens())
                return Long.parseLong(st.nextToken());
            else{
                st = new StringTokenizer(s.readLine());
                return nextLong();
            }
        }
        public String nextString() throws IOException
        {
            if(st.hasMoreTokens())
                return st.nextToken();
            else
            {
                st = new StringTokenizer(s.readLine());
                return nextString();
            }
        }
        public String readLine() throws IOException
        {
            return s.readLine();
        }
        public void close() throws IOException
        {
            s.close();
        } 
	}
    ///////////////////////////////////////////////////////////////////Number Theory
    long pow(long a,long b,long mod)
    {
        long x = 1; long y = a;
        while(b > 0)
        {
            if(b % 2 == 1)
            {
                x = (x*y);
                x %= mod;
            }
            y = (y*y);
            y %= mod;
            b /= 2;         
        }
        return x;
    }
    long divisor(long x)
    {
        long limit =x;
        int numberOfDivisors = 0;
        if(x==1)
        	numberOfDivisors = 1;
        for (int i=1; i < limit; ++i) 
        {
            if (x % i == 0 ) 
            {
                limit = x / i;
                if (limit != i  )
                {
                    numberOfDivisors++;
                }
                numberOfDivisors++;
            }
        }
        return numberOfDivisors;
    }
    void findSubsets(long[] a)
    {
        long numOfSubsets = 1 << a.length; 
        for(int i = 0; i < numOfSubsets; i++){    
            @SuppressWarnings("unused")
			int pos = a.length - 1;
            int bitmask = i;
            while(bitmask > 0){     
                if((bitmask & 1) == 1)
//                    ww.print(array[pos]+" ");
                bitmask >>= 1;
                pos--;
            }
      //      ww.println();
        }
    }
    public static long gcd(long a, long b)
    {
        return b == 0 ? a : gcd(b,a%b);
    }
    public static long lcm(int a,int b, int c)
    {
        return lcm(lcm(a,b),c);
    }
    public static long lcm(long a, long b)
    {
        return (a*b/gcd(a,b));
    }
    public static long invl(long a, long mod)
    {
        long b = mod;
        long p = 1, q = 0;
        while (b > 0) 
        {
            long c = a / b;
            long d;
            d = a;
            a = b;
            b = d % b;
            d = p;
            p = q;
            q = d - c * q;
        }
        return p < 0 ? p + mod : p;
    }
    ////////////////////////////////////////////////////////////////////
//   FastScanner s = new FastScanner(new File("a.pdf"));
//	 PrintWriter ww = new PrintWriter(new FileWriter("output.txt")); 
    static InputStream inputStream = System.in;
    static FastScanner s = new FastScanner(inputStream); 
    static OutputStream outputStream = System.out;
    static PrintWriter ww = new PrintWriter(new OutputStreamWriter(outputStream));
//  private static Scanner s = new Scanner(System.in);
    @SuppressWarnings("unused")
    private static int[][] states = { {-1,0} , {1,0} , {0,-1} , {0,1} };
    //////////////////////////////////////////////////////////////////// 
		public static void main(String[] args)throws IOException
		{
			//new TestClass().solve();
	        //new Hackerank2().solve();
	        new Solution().solve();
	        //new Main().solve();
	        s.close();
	        ww.close();
		}
		public boolean check(Object[] objects, int n)
		{   
		    while(--n>0 && objects[n]==objects[0]);
		    return n!=0;
		}
		public void solve() throws IOException
		{
			int n=s.nextInt();
			while(n-->0)
			{
				int q=s.nextInt();
				ArrayList<Double> ad=new ArrayList<Double>();
				int x[]=new int[q];
				int y[]=new int[q];
				for(int i=0;i<q;i++)
				{
					x[i]=s.nextInt();y[i]=s.nextInt();
				}
				for(int i=0;i<q-1;i++)
					ad.add(Math.sqrt((x[i]-x[i+1])*(x[i]-x[i+1])+(y[i]-y[i+1])*(y[i]-y[i+1])));
				if(check(ad.toArray(),ad.size()))
					ww.println("YES");
				else
					ww.println("NO");
				
			}
		}
}