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

int num[200010],n;
bool bo[200010];
 
inline int rd()
{
	int x=0;char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar());
	for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
	return x;
}

inline bool check(int mid)
{
	for (int i=1;i<=n*2-1;i++) bo[i]=(num[i]<=mid);
	for (int i=0;i<n-1;i++)
	{
		if (bo[n-i]==bo[n-i-1]) return bo[n-i];
		if (bo[n+i]==bo[n+i+1]) return bo[n+i];
	}
	return bo[1];
}

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