#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;
  signed int x[n],y[n],i,j,k,l,a,b,m1=0,m2=0,m3=0;double m,u;
    for(i=0;i<n;++i)
        cin>>x[i]>>y[i];
        for(i=0;i<n-1;++i)
     {if(y[i]==y[i+1])++m2;
      if(x[i]==x[i+1])++m1;
     }if(m1==n-1||m2==n-1)printf("YES");
    else{m=(double)(y[1]-y[0])/(double)(x[1]-x[0]);
        for(i=1;i<n;++i)
            {//printf("1");
            u=(double)(y[i]-y[i-1])/(double)(x[i]-x[i-1]);
            if(u!=m)break;
        }if(i!=n-1)printf("NO");
    else printf("YES");}
            return 0;
}