#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 x[n],y[n];
    for(int a0 = 0; a0 < n; a0++){
        cin >> x[a0] >> y[a0];
    }
    double m;
    if ((x[1]-x[0])==0){
        m=x[0];
    }
    else{
        m=(y[1]-y[0])/(x[1]-x[0]);
    }
    
    bool truth=true;
    if ((x[1]-x[0])==0){
        for (int i=2;i<n;i++){
            if (x[i]!=x[0]){
                truth=false;
                break;
            }
        }
    }
    else{
        for (int i=1;i<n-1;i++){
            double temp;
        
            if ((x[i+1]-x[i])==0){
                truth=false;
                break;
            }
            else{
                temp=(y[i+1]-y[i])/(x[i+1]-x[i]);
            }
            if (temp!=m){
                truth=false;
                break;
            }
        }
    }
    
    if (truth){
        if (n==2){
            if (x[0]==x[1] || y[0]==y[1]){
                cout<<"YES";
            }
            else{
                cout<<"NO";
            }
        }
        else{cout<<"YES";}
    }
    else {
        cout<<"NO";
    }
    return 0;
}