#include <bits/stdc++.h>
#define N 200010

using namespace std;

int n, a[N];

bool chk(int k) {
	int re, res;
	for (int i = 1; i <= n; ++i) 
	if (a[i] >= k) re++;
	else res++;
	if (re >= res) return false;
	else return true;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= 2 * n - 1; ++i) scanf("%d", &a[i]);
	int l = 1, r = 2 * n - 1, ans = 0;
	for (; l <= r; ) {
		int mid = (l + r) / 2;
		if (chk(mid)) {
			ans = mid;
			r = mid - 1;
		} else l = mid + 1;
	}
	printf("%d", ans);
	return 0;
}