#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n,a[200005];
inline bool check(int k){
	if(a[n-1]<=k&&a[n]<=k)return 1;
	if(a[n]<=k&&a[n+1]<=k)return 1;
	if(a[n-1]>k&&a[n]>k)return 0;
	if(a[n]>k&&a[n+1]>k)return 0;
	for(int i=1;i<n-1;i++){
		if(a[n+i]<=k&&a[n+i+1]<=k)return 1;
		if(a[n-i]<=k&&a[n-i-1]<=k)return 1;
		if(a[n+i]>k&&a[n+i+1]>k)return 0;
		if(a[n-i]>k&&a[n-i-1]>k)return 0;
	}
	return (a[1]<=k);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<n<<1;i++)scanf("%d",a+i);
	int l=1,r=(n<<1)-1;
	for(int mid=n;l<r;mid=l+r>>1)
		if(check(mid))r=mid;
		else l=mid+1;
	printf("%d",l);
}