#include<iostream>
#include<cstdio>
using namespace std;
int n, a[200010], b[200010], ans;

bool check(int x) {
	for(int i = 1; i < 2 * n; i++)
		if(a[i] >= x) b[i] = 1;
			else b[i] = 0;
	for(int i = 1; i < n; i++) {
		if(!(b[n + i] ^ b[n + i - 1])) return b[n + i];
		if(!(b[n - i] ^ b[n - i + 1])) return b[n - i];
	}
	return b[1];
}

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