#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<map>
using namespace std;
// #define debug(x) cout<<"[debug]"#x<<"="<<x<<endl
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ld eps=1e-8;
const int INF=0x3f3f3f3f,mod=998244353;
const ll INFF=0x3f3f3f3f3f3f3f3f;

#ifndef ONLINE_JUDGE
#define debug(...)
#include<debug>
#else
#define debug(...)
#endif

const int N=1000006;
int n;
ll a[N],b[N];
ll res=INFF;
ll lowbit(ll x)
{
    return x&-x;
}
void cal(int bit)
{
    ll l=0,r=INFF;
    for(int i=1;i<=n;i++)
    {
        l=max(l,(b[i]<<bit)-a[i]);
        r=min(r,((b[i]<<bit)|((1<<bit)-1))-a[i]);
    }

    if(l>r) return ;
    //p为[l,r]
    
    auto update=[&](ll p){
        ll ans=(p>>bit)+__builtin_popcountll(p&((1<<bit)-1))+bit;
        res=min(res,ans);
    };
    for(ll p=l;p<=r;p+=lowbit(p))
    {
        update(p);
    }
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    for(int i=1;i<=n;i++) scanf("%lld",&b[i]);
    
    for(int w=0;w<30;w++)
    {
        cal(w);
    }
    if(res==INFF) puts("-1");
    else printf("%lld\n",res);
}