#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>
#define fi first
#define se second

using namespace std;
double findarea(int x[],int y[],int n)
{
    
    double a = 0.0;
int w = n - 1;
    for (int i = 0; i < n; i++)
    {
        a += (x[w] + x[i]) * (y[w] - y[i]);
        w = i;  
    }

   
    return abs(a / 2.0);
}
int main(){
    int n;
    cin >> n;
   // pair<int,int>ar[101];
    int x1[100],y1[100];
    int h=0;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
x1[h]=x;
        y1[h]=y;
        h++;
    }
    /*sort(ar,ar+h);
    //set<double>se;
    int i,j;
    int f=0;
    for(i=1;i<h;i++)
        {
        if()
       /* for(j=i+1;j<h;j++){
            double m=(double)(y1[j]-y1[i])/(double)(x1[j]-x1[i]);
            se.insert(m);
        }*/
        
    double ans=findarea(x1,y1,h);
    
    if(ans==0)
        {
        cout<<"YES"<<endl;
    }
    else
        cout<<"NO"<<endl;
    return 0;
}