#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;
    int x1,y1,x2,y2,flag=0,o,c,t;
    int m,m1;
    cin >> x1 >> y1 >> x2 >> y2;
    
    if(x1==x2){
        flag=1;
    }
    else if(y1==y2){
        flag=2;
    }
    else{
        m=(y2-y1)/(x2-x1);
        c=-m*x1+y1;
    }
    
    for(int a0 = 2; a0 < n; a0++){
        if(flag==1){
            int x,y;
            cin >> x >> y;
            if(x!=x1){
                cout << "NO";
                return 0;
            }
        }
        else if(flag==2){
            int x,y;
            cin >> x >> y;
            if(y!=y1){
                cout << "NO";
                return 0;
            }
        }
        else{
            int x,y;
            cin >> x >> y;
            m1=(y2-y)/(x2-x);
            if(m1!=m){
                cout << "NO";
                return 0;
            }
        }
    }
    cout << "YES";
               
    return 0;
}