#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;
    vector<int> xs, ys;
    
    cin >> n;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        
        xs.push_back(x);
        ys.push_back(y);
    }
    
    if(n == 2) {
        cout << "YES";
        return 0;
    }
    
    double tg = 0;
    if(xs[0] - xs[1] != 0) {
        tg = abs(1. * (ys[0] - ys[1]) / (xs[0] - xs[1]));
    }
    
    for(int i = 2; i < n; ++i) {
        double tg_temp = 0;
        if(xs[0] - xs[i] != 0) {
            tg_temp = abs(1. * (ys[0] - ys[i]) / (xs[0] - xs[i]));
        }
        
        if(tg != tg_temp) {
            cout << "NO";
            return 0;
        }
    }
    
    cout << "YES";
    return 0;
}