#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 xmax=-11,ymax=-11;
    int countx=0,county=0;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(a0==0)
            {
            xmax=x;
            ymax=y;
        }
        else
            {
          
            
                if(x==xmax)
                    {
                    countx++;
                }
                if(y==ymax)
                    county++;
            
        }
        
    }
    if(countx==n-1||county==n-1)
        cout<<"YES";
    else
        cout<<"NO";
    return 0;
}