#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 px,py;
    cin >> px >> py;
    int hori = 1,ver = 1;
    for(int a0 = 0; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(hori == 1)
            {
            if(px != x) hori = 0;
        }
        if(ver == 1)
            {
            if(py != y) ver = 0;
        }
    }
    if(hori == 1 or ver == 1)
        {
        cout<<"YES"<<endl;
    }
    else
        cout<<"NO"<<endl;
    return 0;
}