#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 1e6 + 5;

int n;
int a[N], b[N], c[N], d[N];
vector < int > f, g;

bool Check ( int mid ) {
  f.clear (), g.clear ();
  for ( int i = 1; i <= n; i ++ ) {
    if ( a[i] > mid ) {
      f.push_back ( a[i] );
    }
    if ( b[i] > mid ) {
      g.push_back ( b[i] );
    }
  }
  if ( ( f.size () & 1 ) || ( g.size () & 1 ) ) {
    return false;
  }
  for ( int i = 0; i < f.size (); i += 2 ) {
    if ( f[i] != f[i + 1] ) {
      return false;
    }
  }
  for ( int i = 0; i < g.size (); i += 2 ) {
    if ( g[i] != g[i + 1] ) {
      return false;
    }
  }
  return true;
}

void Solve () {
  ios :: sync_with_stdio ( false );
  cin.tie ( 0 ), cout.tie ( 0 );
  cin >> n;
  for ( int i = 1; i <= n; i ++ ) {
    cin >> a[i];
  }
  for ( int i = 1; i <= n; i ++ ) {
    cin >> b[i];
  }
  int l = -1, r = n + 1;
  while ( l + 1 < r ) {
    int mid = l + r >> 1;
    if ( Check ( mid ) ) {
      r = mid;
    }
    else {
      l = mid;
    }
  }
  cout << r;
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}