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

using namespace std;

int n, a[N], b[N];

bool S(int i, int j, int k) {
	return a[i] <= k && a[j] <= k;
}

bool B(int i, int j, int k) {
	return a[i] > k && a[j] > k; 
}

int chk(int k) {
	for (int i = 0; i < n - 1; ++i) {
		if (B(n + i, n + i + 1, k) || B(n - i, n - i - 1, k))
			return 0;
		if (S(n + i, n + i + 1, k) || S(n - i, n - i - 1, k))
			return 1;
	}
	return S(1, 1, n);
}

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)) {
			r = mid;
		} else l = mid + 1;
	}
	printf("%d", r);
	return 0;
}