#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;
    bool in_line = true;
    int prevX =0;
    int prevY =0;
    int m=0;
    bool slope_line = false;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;



        cin >> x >> y;
        if(a0 ==1){
            //(y-y1) = m(x-x1)
            if(x-prevX !=0){
                m = (y-prevY)/(x-prevX);
                slope_line = true;
            }
            else{
                slope_line = false;
                m = 1;
            }
        }
        else if(a0>1){
           if(slope_line){
               if((x-prevX)*m != (y-prevY)){
               in_line = false;
               break;
           }
           }
            else{
                if((x-prevX)!=0){
                    in_line = false;
                    break;
             }
         }

           
        }
         prevX=x;
         prevY=y;
    }
    if(in_line){
       cout<<"YES"<<endl;
    }
    else{
        cout<<"NO"<<endl;
        
    }
    
    return 0;
}