#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n;
  cin >> n;
  vector<pair<int, int>> ab(n);
  for (int i = 0; i < n; ++i)
  {
    int a, b;
    cin >> a >> b;
    ab[i] = {a, b};
  }
  sort(ab.begin(), ab.end());
  for (int i = 1; i < n; ++i) ab[i].second = max(ab[i].second, ab[i - 1].second);
  int now = 1;
  for (int i = 0; i < n; ++i)
  {
    if (ab[i].first > now) break;
    now = max(now, ab[i].second);
  }
  cout << now << endl;
}