#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int n;
    cin >> n;
    vector<vector<float>> points(n,vector<float>(2)); 
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        points[a0][0]=x;
        points[a0][1]=y;
        
    }
    
    if(n<2)
        {
        cout<<"NO"<<endl;
        return 0;            
    }
    
    float yVal = points[1][1]-points[0][1];
    float xVal = points[1][0]-points[0][0];
    float x1,y1;
    float c=0;
    if(n>2)
    {
    for(int i=2;i<n;i++)
        {
        if(i==2)
            {
            y1 = points[2][1] - points[0][1];
            x1 = points[2][0] - points[0][0];             
            if(abs(yVal * x1)!=abs(xVal * y1)){
            cout<<"NO"<<endl;
            return 0;
            }            

            }
        else{
            float s1=(abs((points[i][1]-points[0][1])*xVal*xVal));
            float s2= abs(yVal*xVal *(points[i][0]-points[0][0]) + (y1 * xVal - yVal *x1));            
            if(s1!=s2)
            {
            cout<<"NO"<<endl;
            return 0;
            }
            }        
        }
        
        cout<<"YES"<<endl;
    }
    
    
    return 0;
}