#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 21, inf = 1e7 + 21;
int n;
long long l, r;
long long a[MAXN], b[MAXN];
long long up[MAXN * 3], down[MAXN * 3];
bool mark[MAXN * 3];
vector<long long> vec;
void cmprs() {
  for (int i = 0; i < n; i++) {
    vec.push_back(a[i]);
    vec.push_back(b[i]);
  }
  sort(vec.begin(), vec.end());
  vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
  for (int i = 0; i < n; i++) {
    a[i] = n + lower_bound(vec.begin(), vec.end(), a[i]) - vec.begin();
    b[i] = n + lower_bound(vec.begin(), vec.end(), b[i]) - vec.begin();
  }
}
void input() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
  cmprs();
}
bool dfs(int v, int m) {
  mark[v] = true;
  if ((a[v] <= m + n) &&
      (up[a[v]] == -1 || (!mark[up[a[v]]] && dfs(up[a[v]], m)))) {
    down[v] = a[v];
    up[a[v]] = v;
    return true;
  }
  if ((b[v] <= m + n) &&
      (up[b[v]] == -1 || (!mark[up[b[v]]] && dfs(up[b[v]], m)))) {
    down[v] = b[v];
    up[b[v]] = v;
    return true;
  }
  return false;
}
int max_matching(int xxx) {
  int max_matching = 0;
  memset(up, -1, sizeof up);
  memset(down, -1, sizeof down);
  bool ok = false;
  while (!ok) {
    ok = true;
    memset(mark, false, sizeof mark);
    for (int v = 0; v < n; v++)
      if (down[v] == -1 && !mark[v] && dfs(v, xxx)) {
        ok = false;
        max_matching++;
      }
  }
  return max_matching;
}
void solve() {
  l = n;
  r = vec.size();
  long long res = -1;
  while (r >= l) {
    long long mid = (l + r) >> 1;
    if (max_matching(mid) == n) {
      res = vec[mid - 1];
      r = mid - 1;
    } else
      l = mid + 1;
  }
  cout << res << '\n';
}
int main() {
  input();
  solve();
  return 0;
}
