#include <vector>
#include <list>
#include <map>
#include <set>
#include "queue"
#include <deque>
#include <stack>
#include <numeric>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include <cassert>
#define mod 1000000007
#define eps 1e-4
#define arsize 1000000001
#define INF 0x3f3f3f3f
#define NINF INT_MIN
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define Pi 3.14159265358979323846264338327950288419716939937510
#define size2 10001
#define size1 100001
using namespace std;
//ofstream fout ("/Users/priya/Desktop/A-small-att1.out");
//ifstream fin ("/Users/priya/Desktop/A-large.in");
// int a, b;
// fin >> a >> b;
// fout << a+b << endl;
//  freopen("in", "r", stdin);
//  freopen("out", "w", stdout);
//int dx[] = {1, -1, 0, 0};
//int dy[] = {0, 0, 1, -1};
//int dx[]= {-1,-1,0,0,1,1};
//int dy[]= {-1,0,-1,1,0,1};
//int dx[]= {0,0,1,-1};/*4 side move*/
//int dy[]= {-1,1,0,0};/*4 side move*/
//int dx[]= {1,1,0,-1,-1,-1,0,1};/*8 side move*/
//int dy[]= {0,1,1,1,0,-1,-1,-1};/*8 side move*/
//int dx[]={1,1,2,2,-1,-1,-2,-2};/*night move*/
//int dy[]={2,-2,1,-1,2,-2,1,-1};/*night move*/
//    int x=(n & -n);
//    int x=pow(2,floor(log(n)/log(2)));
#define ll long long int
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define DPMEM(dp) memset(dp,0,sizeof(dp));
#define MEMMIN(dp) memset(dp,-1,sizeof(dp));
#define PR(x) printf("%lld",x);
#define SC(x) scanf("%lld",&x);
#define FOR(x,i) for(ll i=0;i<x;i++)
#define FOR1(x,i) for(ll i=1;i<=x;i++)
#define V vector<ll>
#define VP vector<pair<ll,ll>>
#define S set<ll>
#define SP set<pair<ll,ll>>
#define G vector<VP>
/*
 if(x==0) return 0;
 if(dp[x]!=0) return dp[x];
 ll res=solve(x/2)+solve(x/3)+solve(x/4);
 if(res>x)dp[x]=res;
 else dp[x]=x;
 return dp[x];
*/
int main(){
    ll n; SC(n);
    vector<pair<ll,ll>> v(size1);
    for(ll i=0;i<n;i++){
        ll x,y; SC(x); SC(y);
        //SC(v[i].first); SC(v[i].second);
        v[i].first=x; v[i].second=y;
    }
    bool f=1;
    for(ll i=1;i<n;i++){
        if(v[i].first!=v[0].first){
            f=0;
            break;
        }
    }
    bool g=1;
    for(ll i=1;i<n;i++){
        if(v[i].second!=v[0].second){
            g=0;
            break;
        }
    }
    if(f||g) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}