#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+6;
#define ll long long
#define int long long

void solve()
{
	int n;
	cin>>n;
	vector<ll>a(n+1),b(n+1),c(n+1),d(n+1);
	for(int i=1;i<=n;i++)cin>>a[i],c[i]=i;
	for(int i=1;i<=n;i++)cin>>b[i],d[i]=i;
	int l=1,r=n,ans=0;
	sort(c.begin()+1,c.end(),[=](auto x,auto y){
		return a[x]<a[y];
	});
	while(l<=r){
		int mid=(l+r)>>1;
		auto check1=[=](int k)->bool{
			int bl=0,br=0;
			for(int i=1;i<k;i++){
				if(a[i]>=a[k])bl++;
			}
			for(int i=k+1;i<=n;i++){
				if(a[i]>=a[k])br++;
			}
			int sum=0,ans=0;
			for(int i=1;i<k;i++){
				int yl=(a[i]>=a[k]),now=(b[i]>=a[k]);
				int num=now-yl;
				if(sum<0)sum=0;
				sum=sum+num;
				ans=max(ans,sum);
			}
			int res=bl+br;
			res=max(res,ans+bl+br);
			sum=0,ans=0;
			for(int i=k+1;i<=n;i++){
				int yl=(a[i]>=a[k]),now=(b[i]>=a[k]);
				int num=now-yl;
				if(sum<0)sum=0;
				sum=sum+num;
				ans=max(ans,sum);
			}
			res=max(res,ans+bl+br);
			//cout<<ans<<" "<<bl<<" "<<br<<" "<<k<<endl;
			if(res>=n/2)return true;
			return false;
		};
		if(check1(c[mid]))ans=mid,l=mid+1;
		else r=mid-1;
	}
	ll res=0;
	//cout<<c[ans]<<endl;
	res=a[c[ans]];
	sort(c.begin()+1,c.end(),[=](auto x,auto y){
		return b[x]<b[y];
	});
	l=1,r=n,ans=0;
		while(l<=r){
		int mid=(l+r)>>1;
		auto check2=[=](int k)->bool{
			int ans=0;
			for(int i=1;i<=n;i++){
				if(a[i]>=b[k]&&i!=k)ans++;
			}
			int ansl=0,ansr=0,sum=0;
			for(int i=k+1;i<=n;i++){
				int yl=(a[i]>=b[k]),now=(b[i]>=b[k]);
				int num=now-yl;
				sum+=num;
				ansr=max(ansr,sum);
			}
			sum=0;
			for(int i=k-1;i>=1;i--){
				int yl=(a[i]>=b[k]),now=(b[i]>=b[k]);
				int num=now-yl;
				sum+=num;
				ansl=max(ansl,sum);
			}
			if(ans+ansl+ansr>=n/2)return true;
			return false;
		};
		if(check2(c[mid]))ans=mid,l=mid+1;
		else r=mid-1;
	}
	res=max(res,b[c[ans]]);
	cout<<res<<endl;
}
signed  main(){
	ios::sync_with_stdio(false);	
	int t=1;
	//cin>>t;
	while(t--)solve();
	return 0;
}