#include <bits/stdc++.h>

size_t n;

typedef std::pair<int, int> two;
two input_array[300005];
int worth[300005];

inline bool check(int mid) {
  int counter = 0;
  // std::cout << "# " << mid << "\n|";
  for (size_t i = 0; i < n; ++i) { 
    if (input_array[i].first < mid) { ++counter; }
    if (input_array[i].first < mid && input_array[i].second >= mid) { worth[i] = 1; }
    else if (input_array[i].first >= mid && input_array[i].second < mid) { worth[i] = -1; }
    else { worth[i] = 0; }
    // std::cout << " " << worth[i];
  }
  // std::cout << "\n| " << counter << "\n";
  for (size_t i = 1; i < n; ++i) { worth[i] += worth[i - 1]; }
  int min_index = -1;
  for (size_t i = 0; i < n; ++i) {
    if (worth[i] - (min_index < 0 ? 0 : worth[min_index]) >= counter - n / 2) { return true; }
    if (worth[i] < worth[min_index]) { min_index = i; }
  }
  return false;
}

inline void solve() {
  size_t *index_array;
  index_array = new size_t[n];
  for (size_t i = 0; i < n; ++i) { index_array[i] = i; }
  std::sort(index_array, index_array + n, [=](const size_t &x, const size_t &y) { return input_array[x].first < input_array[y].first; });

  int answer = input_array[index_array[n / 2]].first;
  size_t length = INT32_MAX - answer;
  while (length > 0) {
    size_t half = length - (length >> 1);
    int mid = answer + half;
    if (check(mid)) {
      answer = mid;
      length = length - half;
    } else {
      length = half - 1;
    }
  }
  std::cout << answer << std::endl;
}

signed main() {
  std::cin >> n;
  for (size_t i = 0; i < n; ++i) {
    std::cin >> input_array[i].first >> input_array[i].second;
  }
  solve();
  return 0;
}