#include <bits/stdc++.h>
using namespace std;
int adj[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int coradj[4][2] = {{1, 1}, {-1, 1}, {-1, -1}, {1, -1}};
int alladj[8][2] = {{1, 1},   {0, 1},  {-1, 1}, {-1, 0},
                    {-1, -1}, {0, -1}, {1, -1}, {1, 0}};
int gcd(int a, int b) { return ((b) ? gcd(b, a % b) : a); }
int rem(int a, int n) { return (a % n + n) % n; }
int n, x[(100 + 10)], d[(100 + 10)];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> d[i];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      if (i != j)
        if (x[i] + d[i] == x[j] && x[j] + d[j] == x[i]) {
          cout << "YES" << endl;
          return 0;
        }
  cout << "NO" << endl;
  return 0;
}
