#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,xi,yi;
    double m;
    cin >> n;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(a0==1)
           m=(double)(xi-x)/(double)(yi-y);
        else if(a0>1)
            {
            double m1=(double)(xi-x)/(double)(yi-y);
            //cout << m << " "<< m1 << endl;
            
            if(m1!=m)
                {
                cout << "NO";
                return 0;
            }
        }
        xi=x;
        yi=y;
    }
    cout << "YES";
    return 0;
}