#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,s1,i,s2,sl,nu,de,te,ty;
    bool aa=0;
    vector<pair<int,int> > v;
    cin >> n;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        v.push_back(make_pair(x,y));
    }
    sort(v.begin(),v.end());
    s1=abs((v[1].second-v[0].second));
    s2=abs((v[1].first-v[0].first));
    sl=__gcd(s1,s2);
    if(sl==0){
        printf("NO");
        return 0;
    }
    nu=s1/sl;
    de=s2/sl;
    for(i=1;i<n-1;i++){
        s1=abs((v[i+1].second-v[i].second));
        s2=abs((v[i+1].first-v[i].first));
        
        sl=__gcd(s1,s2);
        if(sl!=0)
        te=s1/sl;
        if(sl!=0)
        ty=s2/sl;
        if(te!=nu || ty!=de) aa=1;
        if(sl==0) aa=1;
      // cout<<v[i].first<<" "<<v[i].second<<endl;
    }
    if(aa) printf("NO");
    else printf("YES");
    return 0;
}