import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
		Scanner s = new Scanner(System.in);

		int q = s.nextInt();
		for (int j = 0; j < q; j++) {

			int n = s.nextInt();

			int[] x = new int[n];
			int[] y = new int[n];
			boolean flag = true;

			for (int i = 0; i < n; i++) {
				x[i] = s.nextInt();
				y[i] = s.nextInt();
			}
			

			if (n > 1) {
				int xDistance = 0;
				int yDistance = 0;
				

//				for (int i = 0; i < n; i++) {
//					if (x[i] != 0 && xDistance == 0) {
//						xDistance = x[i];
//					} else if (x[i] != 0 && x[i] != xDistance) {
//						flag = false;
//					}
//					if (y[i] != 0 && yDistance == 0) {
//						yDistance = y[i];
//					} else if (y[i] != 0 && y[i] != yDistance) {
//						flag = false;
//					}
//				}
				for(int i = 0; i < n - 1; i++) {
					if(x[i] != x[i+1] && xDistance == 0) {
						xDistance = Math.abs(x[i] - x[i+1]);
					} else if(x[i] != x[i+1] && xDistance != Math.abs(x[i] - x[i+1]) && y[i] != y[i+1] && yDistance != Math.abs(y[i] - y[i+1])) {
						flag = false;
						break;
					}
					if(y[i] != y[i+1] && yDistance == 0) {
						yDistance = Math.abs(y[i] - y[i+1]);
					} else if(y[i] != y[i+1] && yDistance != Math.abs(y[i] - y[i+1]) && x[i] != x[i+1] && xDistance != Math.abs(x[i] - x[i+1])) {
						flag = false;
						break;
					}
				}
			}
			
			if (flag)
				System.out.println("YES");
			else
				System.out.println("NO");
		}
		
		s.close();
	}
}