#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
    }
    n >>= 1;
    a *= a;
  }
  return p;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, x[110], d[110], f;
  cin >> n;
  for (int(i) = 0; (i) < (n); (i)++) {
    cin >> x[i] >> d[i];
  }
  for (int(i) = 0; (i) < (n); (i)++) {
    f = 0;
    for (int(j) = 0; (j) < (n); (j)++) {
      if (x[i] + d[i] == x[j] && x[j] + d[j] == x[i]) return cout << "YES", 0;
    }
  }
  cout << "NO";
  return 0;
}
