#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;
    int flagx=1,flagy=1;
    int prevx,prevy;
    cin >> n;
    cin>>prevx>>prevy;
    for(int a0 = 1; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if(x!=prevx) flagx=0;
        if(y!=prevy) flagy=0;
    }
    if(flagx || flagy) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}