#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

struct RadixHeap {
	typedef unsigned T;
	enum { B = 32 };
	vector<T> buckets[B + 1];
	T minimums[B + 1];
	T last;
	unsigned bucketsmask;

	RadixHeap() { clear(); }

	void clear() {
		for(int k = 0; k <= B; ++ k)
			buckets[k].clear();
		for(int k = 0; k <= B; ++ k)
			minimums[k] = numeric_limits<T>::max();
		last = 0;
		bucketsmask = 0;
	}

	void push(T x) {
		assert(last <= x);
		push(x, last);
	}

	T pop() {
		pull();
		buckets[0].pop_back();
		return last;
	}

private:
	void push(T x, T t) {
		int k = findBucket(t, x);
		buckets[k].push_back(x);
		amin(minimums[k], x);
		bucketsmask |= 1U << k;
	}

	void pull() {
		if(!buckets[0].empty()) return;
		int k = bsf(bucketsmask & ~1U);
		unsigned t = minimums[k];
		each(i, buckets[k])
			push(*i, t);
		last = t;
		buckets[k].clear();
		bucketsmask &= ~(1U << k);
		minimums[k] = numeric_limits<T>::max();
	}

	static int findBucket(unsigned x, unsigned y) {
		return x == y ? 0 : bsr(x ^ y) + 1;
	}

	static int bsr(unsigned x) {
#if defined(__GNUC__)
		return 31 - __builtin_clz(x);
#else
		unsigned long res;
		_BitScanReverse(&res, x);
		return res;
#endif
	}

	static int bsf(unsigned x) {
#if defined(__GNUC__)
		return __builtin_ctz(x);
#else
		unsigned long res;
		_BitScanForward(&res, x);
		return res;
#endif
	}

};

int main() {
	int N;
	scanf("%d", &N);
	vector<int> A(N), B(N);
	rep(i, N) scanf("%d", &A[i]);
	rep(i, N) scanf("%d", &B[i]);

	sort(all(A));
	rep(i, N) B[i] /= 2;

	const int X = *max_element(all(A)) + accumulate(all(B), 0);
	const int Y = 1500;
	const int logY = 11, maskY = (1 << logY) - 1;

	RadixHeap heap;
	
	int ans = INF;
	rep(i, N) {
		heap.clear();
		rep(j, N)
			heap.push(A[j] << logY | 0);
		int x = 0;
		for(int j = i; ; ) {
			unsigned t = heap.pop();
			heap.push(t + (B[j] << logY) + 1);
			amax(x, (int)(t & maskY) + 1);

			if((++ j) == N) j = 0;
			if(j == i) break;
		}
		amin(ans, x);
	}
	printf("%d\n", ans);
	return 0;
}