#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=2e5+5;
int m,n,a[N];
bool b[N];

bool solve()
{
	rep(i,1,m-1)
	{
		if(b[m-i+1]==b[m-i])return b[m-i];
		if(b[m+i-1]==b[m+i])return b[m+i];
	}
	return b[m]^((m-1)%2);
}

int main()
{
	//freopen("1.in","r",stdin);
	cin>>m;
	n=m*2-1;
	rep(i,1,n)scanf("%d",a+i);
	int l=1,r=n+1;
	while(l+1!=r)
	{
		int mid=(l+r)/2;
		rep(i,1,n)b[i]=a[i]>=mid;
		if(solve())l=mid;
		else r=mid;
	}
	cout<<l;
}