#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>
#include <stack>

using namespace std;


int main(){
    int n;
    cin >> n;
    stack<int> xc,yc;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(xc.empty() || xc.top()!=x)
            xc.push(x);
        if(yc.empty() || yc.top()!=y)
            yc.push(y);
    }
    if(xc.size()==1 || yc.size()==1)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return 0;
}