import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a[][]=new int[n][2];
        int flag=0,m,x;
        for(int a0 = 0; a0 < n; a0++){
            int x1 = in.nextInt();
            int y = in.nextInt();
            a[a0][0]=x1;
            a[a0][1]=y;
        }
        if(a[1][0]-a[0][0] == 0)
            m=0;
        else
         m=-((a[1][1]-a[0][1])/(a[1][0]-a[0][0]));
        for(int i=1;i<n-1;i++)
            {
            if(a[i+1][0]-a[i][0] == 0)
                x=0;
            else
             x=-(a[i+1][1]-a[i][1])/(a[i+1][0]-a[i][0]);
            
            if(m==x)
                continue;
            else
                {
                flag=1;
                break;
            }
        }
        if(flag==1)
            System.out.println("NO");
        else
            System.out.println("YES");
    }
}