#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 x[111],y[111];
int v[300],v1[300];
int main(){
    int n;
    cin >> n;
    for(int a0 = 1; a0 <= n; a0++){
        cin >> x[a0] >> y[a0];
        v[x[a0]+20]++;
        v1[y[a0]+20]++;
        
    }
    for(int i=1;i<100;i++){
        if(v[i]==n){
            cout<<"YES";
            return 0;
        }
        if(v1[i]==n){
            cout<<"YES";
            return 0;
        }
    }
    cout<<"NO";
    return 0;
    /*double a,b;
    a=(y[2]-y[1])/((1.0)*(x[2]-x[1]));
    b=(y[1]-a*x[1]);
   // cout<<a<<' '<<b<<endl;*/
    /*for(int i=3;i<=n;i++){
        if((y[i]-y[1])*(x[2]-x[1])!=(y[2]-y[1])*(x[i]-x[1])){
            cout<<"NO";
            return 0;
        }
    }*/
    cout<<"YES";
    return 0;
}