#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;
    bool contX = true;
    bool contY = true;
    int firstx, firsty;
    cin >> firstx >> firsty;
    for(int a0 = 1; a0 < n; a0++){
        int x;
        int y;
        cin >> x >> y;
        if (x != firstx)
            contX = false;
        if (y != firsty)
            contY = false;
        if (!(contX || contY))
            {
            cout << "NO";
            return 0;
        }
    }
    cout << "YES";
    return 0;
}