#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;
    int ans;
    cin >> n;
    int x, y;
    float s;
    cin >> x >> y;
    int z = 0;
    bool fail = 0;
    if(x==0){
        z = 0;
    }
    for(int a0 = 1; a0 < n; a0++){
        int x1, y1, s1;
        cin >> x1 >> y1;
        if(x1==x){
            z = 2;
        }
        else{
            if(z==2){
                fail = 1;
            }
            else {
                if(a0==1){
                    s = (y1-y)/(x1-x);
                }
                s1 = (y1-y)/(x1-x);
                if(s1 == s){
                    s = s1;
                    x = x1;
                    y = y1;
                }
                else {
                    fail = 1;
                }    
            }
        }
        if(fail){
            break;
        }
    }
    if(fail){
            cout<<"NO"<<endl;
        }
        else{
            cout<<"YES"<<endl;
        }
    return 0;
}