#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-12;
const int INF = 1 << 30;
const long long LINF = 1ll << 61;
const int BUFFER_SZ = 1 << 20;
const int MOD = 1000 * 1000 * 1000 + 7;
char BUFFER[BUFFER_SZ];
int gi() {
  int x;
  scanf("%d", &x);
  return x;
}
double gd() {
  double x;
  scanf("%lf", &x);
  return x;
}
long long gll() {
  long long x;
  scanf("%lld", &x);
  return x;
}
vector<int> gvi(int n) {
  vector<int> a;
  while (n-- > 0) a.push_back(gi());
  return a;
}
string gs() {
  scanf("%s", BUFFER);
  return string(BUFFER);
}
template <class T>
void print(vector<T> &x, string format) {
  format += "%c";
  for (int i = 0; i < x.size(); ++i)
    printf(format.c_str(), x[i], i + 1 == x.size() ? '\n' : ' ');
}
void solve() {
  int n = gi();
  map<pair<int, int>, int> X;
  for (int i = 0; i < n; ++i) {
    int a = gi();
    int b = gi() + a;
    if (a > b) swap(a, b);
    X[{a, b}]++;
    if (X[{a, b}] > 1) {
      printf("YES\n");
      return;
    }
  }
  printf("NO\n");
}
int main() {
  solve();
  return 0;
}
