#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 <int> myx(n);
    vector <int> myy(n);
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        myx.push_back(x);
        myy.push_back(y);
    }
    reverse(myx.begin(), myx.end());
     reverse(myy.begin(), myy.end());
    int slope;
    bool flag = true;
    if(myx[1] - myx[0] == 0) {
        slope = 0;
    }
    else {
        slope = (myy[1] -  myy[0]) / (myx[1] - myx[0]);
    }
    for(int i = 1; i < n - 1; i++) {
        if(myx[i + 1] - myx[i] != 0) {
            if(((myy[i + 1] - myy[i]) / (myx[i + 1] - myx[i])) != slope) {
                flag = false;
               
                break;
            }
        }
     }
    if(flag) {
        cout << "YES" << endl;
    }
    else cout << "NO" << endl;
    return 0;
}