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

typedef long long ll;

struct point {
    
    ll x,y;
    
    point() {}
    
    point(point & p) {
        x = p.x;
        y = p.y;
    }
    
};

int main(){
    ll n;
    cin>>n;
    vector<point> v(n);
    for(ll i=0;i<n;i++) {
        cin>>v[i].x>>v[i].y;
    }
    bool xe = true, ye = true;
    ll x = v[0].x,y = v[0].y;
    for(ll i=1;i<n;i++) {
        if(x!=v[i].x) {
            xe = false;
        }
        if(y!=v[i].y) {
            ye = false;
        }
    }
    if(xe || ye) {
        cout<<"YES";
    } else {
        cout<<"NO";
    }
    return 0;
}