import java.util.Scanner;

public class Solution {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int x1 = in.nextInt( );
		int y1 = in.nextInt( );

		int x2 = in.nextInt( );
		int y2 = in.nextInt( );
		int dx1 = x2 - x1;
		int dy1 = y2 - y1;

		if ( (dx1 != 0) && (dy1 != 0) ) {
			System.out.println("NO");
			return;
		}
		for(int a0 = 2; a0 < n; a0++) {
			int x = in.nextInt( );
			int y = in.nextInt( );
			int dxc = x - x1;
			int dyc = y - y1;
			int cross = dxc * dy1 - dyc * dx1;
			if ( (cross != 0) || !((y == y1) || (x == x1)) ) {
				System.out.println("NO");
				return;
			}
		}

		System.out.println("YES");
	}
}