#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e6+5;
ll A[maxn],B[maxn];
ll N;
int main(){
   ios_base::sync_with_stdio(false);
   cin.tie(0);
   cin>>N;
   for(int i=1;i<=N;i++)
      cin>>A[i];
   for(int i=1;i<=N;i++)
      cin>>B[i];
   ll res=1e18;
   for(int k=2;k<=2;k++){
      ll l=-1e18,r=1e18;
      for(int i=1;i<=N;i++){
         l=max(l,B[i]*(1<<k)-A[i]);
         r=min(r,B[i]*(1<<k)+(1<<k)-1-A[i]);
      }
      if(r<0 or r<l)
         continue;
      if(l==0){
         res=min(res,(ll)k);
         continue;
      }
      while(l<=r){
			res=min(res,l/(1ll<<k)+__builtin_popcount(l&((1ll<<k)-1))+k);
			if(l==0)break;
			l+=l&-l;
		}
   }
   if(res<1e18)
      cout<<res<<"\n";
   else
      cout<<"-1\n";
   return 0;
}
/*
5
1 2 3 4 5
6 6 6 6 7
*/