#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;
    double m;
    cin>>x1>>y1>>x2>>y2;
    bool minf = false, lie = true;
    if(x2-x1 == 0)
        minf = true;
    else
        m = (y2-y1)/((double)x2-x1);
    if( m != 0 && !minf)
        lie = false;
    for(int a0 = 2; a0 < n; a0++){
        int x,y;
        cin >> x >> y;
        if(minf)
        {
            if(x != x1)
                lie = false;
        }
        else
        {
            if(y != m*x - m*x1 + y1)
                lie = false;
        }
    }
    cout<<(lie?"YES":"NO")<<endl;
    return 0;
}