#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++){
    cin >> a[i];
  }
  vector<long long> b(n);
  for (int i = 0; i < n; i++){
    cin >> b[i];
  }
  long long ans = INF;
  for (int i = 0; i < 32; i++){
    long long L = -INF, R = INF;
    for (int j = 0; j < n; j++){
      long long mn = (b[j] << i) - a[j];
      long long mx = ((b[j] + 1) << i) - 1 - a[j];
      mn = max(mn, (long long) 0);
      if (mn > mx){
        L = INF;
        R = -INF;
      } else {
        L = max(L, mn);
        R = min(R, mx);
      }
    }
    if (L <= R){
      long long cnt = i;
      for (int j = 0; j < i; j++){
        if (L % 2 == 1){
          cnt++;
        }
        L /= 2;
      }
      cnt += L;
      ans = min(ans, cnt);
    }
  }
  if (ans == INF){
    cout << -1 << endl;
  } else {
    cout << ans << endl;
  }
}