#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;
    vector<pair<int,int> > vec;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        pair<int,int> P(x,y);
        vec.push_back(P);
    }
    bool line_x = true;
    int x_coord = vec[0].first;
    int y_coord = vec[0].second;
    for(int i=1;i<n;++i)
        {
        if(vec[i].first != x_coord)
            {
            line_x = false;
            break;
        }
    }
    bool line_y = true;
    for(int i=1;i<n;++i)
        {
        if(vec[i].second != y_coord)
            {
            line_y = false;
            break;
        }
    }
    if(!line_x && !line_y)
        {
        cout<<"NO"<<endl;
    }
    else
        {
        cout<<"YES"<<endl;
    }
    return 0;
}