#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;
    double* slope=new double[n];
    int count=0;
    for(int i = 0; i < n; i++){
        double x;
        double y;
        cin >> x >> y;
        slope[i]=x/y;
        if(i>0){
            if(slope[i]==slope[i-1]){
                count++;
                continue;
            }
            else
                 break;
        }
    }
    if(count==n-1)
        cout<<"YES";
    else
        cout<<"NO";
    return 0;
}