#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;
    vector<int> x,y;
    int cnt=0,fl=0,fl2=0;
    int pre_g,pre_f,flag=0;
    float sl,pre_sl;
    for(int a0 = 0; a0 < n; a0++){
        int g,f;
        cin>>g>>f;
        if(g==0)
            cnt++;
        else
        {
        if(fl==0)
        {
          fl=1;
        }
        else
        {
            if(fl2==0&&pre_g!=g)
                {
                sl=(pre_f-f)/(pre_g-g);
                fl2=1;
            }
            else
                {
                 if(pre_g!=g)
                 {
                     sl=(pre_f-f)/(pre_g-g);
                     if(pre_sl!=sl)
                         flag=1;
            }
            else
                sl=0;
            }
            pre_sl=sl;
        }
        pre_f=f;
        pre_g=g;
        }
    }
    
    if(cnt!=n&&cnt>0)
        cout<<"NO\n";
    else if(cnt==n)
         cout<<"YES\n";
    else if(flag==1)
         cout<<"NO\n";
    else if(flag==0)
         cout<<"YES\n";
    
    
    return 0;
}