#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 commonx;
    int commony;
    bool first = true;
    bool deciderx = true;
    bool decidery = true;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(first == true)
            {
                commonx=x;
                commony=y;
                first=false;
            }
        if(commonx != x) deciderx=false;
        if(commony != y) decidery=false;
        
    }
    if(deciderx == true|| decidery==true)
        cout<<"YES";
    else 
        cout<<"NO";
    return 0;
}