#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 loc1=0,loc2=0,count=0;
    float prev,m=0;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        prev=m;
        cin >> x >> y;
        if(loc1==0 && x==0)
            count++;
        else{
        m=(y-loc2)/(x-loc1);
        loc1=x;
        loc2=y;
        if((prev==m)){
        if((y-loc2)==m*(x-loc1) )
            {
            count++;
        }
        }
    }
    }
    if(count==n){
        cout<<"YES"<<endl;
       
    }
    else cout<<"NO"<<endl;
    return 0;
}