/*input 5 0 1 0 2 0 3 0 4 0 5 */ #include using namespace std; #define ll long long #define trace1(x) cerr << #x << ": " << x << endl; #define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl; //loops #define f(i,s,n) for(ll i=(ll)s;i<(ll)n;i++) #define rf(i,n,s) for(ll i=(ll)(n-1);i>=(ll)s;i--) #define raf(i,v) for(__typeof(v.begin())i=v.begin(); i!=v.end(); i++) #define pb push_back //reset #define ms0(X) memset((X), 0, sizeof((X))) #define ms1(X) memset((X), -1, sizeof((X))) //STL #define pii pair #define vll vector #define vpii vector #define mpii map #define msll map #define mll map #define sortv(v) sort(v.begin(),v.end()) #define F first #define S second //standard values #define EPS 1e-6 #define mod 1000000007LL #define INF 100000000000LL #define MAXN 100005LL //comparator bool cmp(pii a,pii b){ if(a.F==b.F) return a.S>n; f(i,0,n){ ll a,b; cin>>b>>a; v.pb({a,b}); } bool fg=1; ll id=v[0].F; f(i,0,v.size()){ if(v[i].F!=id){ fg=0; break; } } if(!fg) { id=v[0].S; fg=1; f(i,0,v.size()){ if(v[i].S!=id){ fg=0; break; } } } if(fg) { cout<<"YES"<