#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) (x).size())
typedef __int128 ll;
//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";
}

ll one = 1;

ll my_popcount(ll x){
  unsigned long long a = x>>64;
  unsigned long long b = x & ((one << 64)-1);
  ll res =  __builtin_popcountll(a) + __builtin_popcountll(b);
  //assert(res == __builtin_popcountll(x));
  return res;
}

ll my_clz(ll x){
  unsigned long long a = x>>64;
  unsigned long long b = x & ((one << 64)-1);
  ll res;
  if(a == 0)
    res = 64 + __builtin_clzll(b);
  else
    res = __builtin_clzll(a);
  //assert(res == __builtin_clzll(x));
  return res;
}

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++){
    int x;
    cin >> x;
    A[i] = x;
  }
  for(int i=0; i<N; i++){
    int x;
    cin >> x;
    B[i] = x;
  }
  //print(A);
  //print(B);
  ll res = -1;
  for(int k=0; k<80; k++){
    ll l = 0, h = one<<120;
    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 << l << "," << h << " ";
    }
    //cout << endl;
    //cout << k << ": " << l << " - " << h << endl;
    if(l > h)
      continue;
    ll cur = k;

    ll diff, first_digit;

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

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