#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;
    int temp;
    bool x_flag = true;
    bool y_flag = true;
    vector<int> x_coordinate;
    vector<int> y_coordinate;
    if(n<=1){
        cout << "YES\n";
        return 0;
    }
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        
        x_coordinate.push_back(x);
        y_coordinate.push_back(y);
    }
    temp = x_coordinate[0];
    for(int i = 1; i < n; i ++)
    {
        if(temp != x_coordinate[i])
        {
            x_flag = false;
        } 
    }
    temp = y_coordinate[0];
    for(int i = 1; i < n; i ++)
    {
        if(temp != y_coordinate[i])
        {
            y_flag = false;
        } 
    }
    if(x_flag || y_flag)
    {
        cout << "YES\n";
    }
    else
        cout << "NO\n";
    return 0;
}