#include <bits/stdc++.h>
using namespace std;
const long long mo = 1e9 + 7;
const long long INF = 0x7f7f7f7f7f7f7f7f;
template <typename _T>
_T Fabs(_T x) {
  return x < 0 ? -x : x;
}
int n, fa[2000005], a[2000005], b[2000005];
int p[2000005], tot;
void makeSet(int x) {
  for (int i = 1; i <= x; i++) fa[i] = i;
}
int findSet(int x) { return fa[x] == x ? fa[x] : fa[x] = findSet(fa[x]); }
signed main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    scanf("%d %d", &a[i], &b[i]), p[++tot] = a[i], p[++tot] = b[i];
  sort(p + 1, p + tot + 1);
  tot = unique(p + 1, p + tot + 1) - p - 1;
  makeSet(tot + 1);
  for (int i = 1; i <= n; i++) {
    a[i] = lower_bound(p + 1, p + tot + 1, a[i]) - p;
    b[i] = lower_bound(p + 1, p + tot + 1, b[i]) - p;
    int u = findSet(a[i]), v = findSet(b[i]);
    if (u > tot && v > tot) {
      puts("-1");
      return 0;
    }
    if (u == v) {
      fa[u] = tot + 1;
      continue;
    }
    if (u > v) swap(u, v);
    fa[u] = v;
  }
  for (int i = tot; i > 0; i--)
    if (fa[i] != i) {
      printf("%d\n", p[i]);
      return 0;
    }
  return 0;
}
