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

bool isOnline(vector<pair<int, int>>& points) {
    size_t n = points.size();
    if (n <= 1) return false;
    int x = points[0].first;
    int y = points[0].second;
    bool same_x = true;
    bool same_y = true;
    for (size_t i = 1; i < n; ++i) {
        same_x = same_x && x == points[i].first;
        same_y = same_y && y == points[i].second;
    }
    
    return same_x || same_y;
}

int main(){
    int n;
    cin >> n;
    vector<pair<int, int>> points;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        points.push_back({x, y});
    }
    if (isOnline(points)) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}