#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;


bool onLine(double[], double[], int);

int main(){
    int n, x0, y0;
    cin >> n;
    double xCoor[n];
    double yCoor[n];
    
    for(int i=0; i<n; i++)
    {
        cin >> xCoor[i];
        cin >> yCoor[i];
    }

    if(onLine(xCoor, yCoor, n))
    {
        cout << "YES";
    }
    else
    {
        cout << "NO";
    }
    
    
    return 0;
}

bool onLine(double xCoor[], double yCoor[], int n)
{
    double slope = (xCoor[1] - xCoor[0]) / (yCoor[1] - yCoor[0]);
    
    for(int i=1; i<n-1; i++)
    {
        double slope2 = (xCoor[i+1] - xCoor[i]) / (yCoor[i+1] - yCoor[i]);
        
        if(slope2 != slope)
            {
            return false;
        }
    }
    return true;
}