#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 m,c;
    int x1,y1;
    int isSlopeInf = 0;
    int vx ;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(a0==0){
            x1=x;
            y1=y;
        }
        if(a0==1){
            
            
            
            if(x==x1){
                 isSlopeInf = 1;
                vx = x;
            }
            
               
            else{
               if(y==y1){
                   m=0;
                   c=y;
               }
                   
                else{
                cout<<"NO"<<endl;
                return -1;
            }
                
                
            }
            
        }
        if(a0>1){
            if(isSlopeInf){
                if(x!=vx){
                
                cout<<"NO"<<endl;
                return -1;
        }
            }
            else if(y!=m*x+c){
                
                cout<<"NO"<<endl;
                return -1;
        }
        
    }
    }
    cout<<"YES"<<endl;
    
    return 0;
}