#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 first_x,first_y;
    double slope=0;
    int flag=0;
    int c=0;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(a0==0)
        {
            first_x=x;
            first_y=y;
        }
        else if(a0==1)
        {    
            if(first_x-x!=0)
            {
                slope=(y-first_y)/(x-first_x);
            }
            c=y-slope*x;
        }   
        else if(first_x-x!=0)
        {    
            //if((y-first_y)/(x-first_x)!=slope)
            if(y!=(slope*x+c))
            {    
                flag=1;
                cout<<"NO"<<endl;
            }    
        }
        else if((first_x-x==0)&&(slope!=0))
        {
            flag=1;
            cout<<"NO"<<endl;   
        }        
    }
    if(flag==0)
        cout<<"YES"<<endl;
    return 0;
}