#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;
    double p=0;
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    if(a-c!=0){
        p=(b-d)/(a-c);
    }
    for(int a0 =2; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        double r=0;
        if(a-x!=0)r=(b-y)/(a-x);
        if(r!=p){
            cout<<"NO"<<endl;
            return 0;
        }
    }
    cout<<"YES"<<endl;
    return 0;
}