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

using namespace std;


int main(){
    int n;
    cin >> n;
    unordered_set<int> sx;
    unordered_set<int> sy;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        sx.insert(x);
        sy.insert(y);
    }
    if(sx.size()==1||sy.size()==1) printf("YES\n");
    else printf("NO\n");
    return 0;
}