#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) (x).size())
typedef long long ll;
typedef pair<int,int> pii;
template<class T> void print(T & x){ cout << x; }
template<class T,class U> void print(pair<T,U> & p){cout << "("; print(p.first); cout << ", "; print(p.second); cout << ")"; }
template<class T> void print(vector<T> & v) {
  cout << "{";
  if (sz(v)) print(v[0]);
  for (int i = 1; i < sz(v); i++) cout << ", ", print(v[i]);
  cout << "}\n";
}


int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  vector<ll> A(N), B(N);
  for(int i=0; i<N; i++)
    cin >> A[i];
  for(int i=0; i<N; i++)
    cin >> B[i];
  ll res = -1;
  for(int k=0; k<33; k++){
    ll l = 0, h = 1ll<<62;
    for(int i=0; i<N; i++){
      ll low = (B[i] << k) - A[i];
      ll hi = ((B[i]+1) << k) - 1 - A[i];
      l = max(l, low);
      h = min(h, hi);
    }
    //cout << k << ": " << l << " - " << h << endl;
    if(l > h)
      continue;
    ll cur = k;

    ll diff, first_digit;

    if(l >= (1ll<<(k+1))){
      cur += (l>>(k+1)) * 2;
      if((l >> (k+1)) != (h >> (k+1))){
        l &= (1ll<<(k+1))-1;
        if(l <= (1<<k))
          cur++;
        else
          cur += 2;
        goto DONE;
      }
      else{
        l &= (1ll<<(k+1))-1;
        h &= (1ll<<(k+1))-1;
      }
    }
    //cout << ".. " << l << " -- " << h << ": " << cur << endl;
    diff = l ^ h;
    if(diff == 0){
      
    }
    else{
      first_digit = 1ll<<(63-__builtin_clzll(diff));
      h &= ~(first_digit-1);
    }
    cur += __builtin_popcountll(h);

DONE:
    //cout << "-> " << cur << endl;
    if(res == -1 || cur < res)
      res = cur;
  }
  cout << res << endl;
}