/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int n,a[1000005],b[1000005],ans=INF;
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) cin>>b[i];
	for(int k=0;k<=30;k++)
	{
		int L=0,R=9LL*INF;
		
		for(int i=1;i<=n;i++)
		{
			int l=(b[i]<<k),r=((b[i]+1)<<k)-1;
			l-=a[i],r-=a[i];
			L=max(L,l),R=min(R,r);
			
		}
		if(L>R) continue;
		int d=L;
		if(d>=0) 
		{
			int nw=k;
			for(int i=0;i<k;i++) if(d&(1<<i)) nw++,d^=(1<<i);
			nw+=(d>>k);
			ans=min(ans,nw);
		}
	}
	if(ans==INF) ans=-1;
	cout<<ans<<"\n";
}
signed main()
{
//	ios::sync_with_stdio(0);
//	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}