#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,countX = 0, countY = 0;
    cin >> n;
    int x[n], y[n];
    
    for(int a0 = 0; a0 < n; a0++){
        cin >> x[a0] >> y[a0];
    }
    
    for(int a0 = 1; a0 < n; a0++) {
        if(x[0] == x[a0]) {
            countX++;
        }
        if(y[0] == y[a0]) {
            countY++;
        }
    }
    
    if((++countX) % n == 0) {
        cout << "YES" << "\n";
    }
    
    else if((++countY) % n == 0) {
        cout << "YES" << "\n";
    }
    
    else {
        cout << "NO" << "\n";
    }
    
    return 0;
}