#include <iostream>

const int inf = 2e9;
const int N = 1000005;

int a[N], b[N];
int n;

int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", b + i);
  }
  long long ans = 1e12;
  for (int k = 0; k <= 31; ++k) {
    int mn = inf, mx = 0;
    for (int i = 1; i <= n; ++i) {
      int t = b[i] - (a[i] >> k);
      mn = std::min(mn, t);
      mx = std::max(mx, t);
    }
    if (mn < 0) continue;
    if (mx - mn > 1) continue;
    if (mx == mn) {
      ans = std::min(ans, 1ll * k);
      continue;
    }
    int l = 0, r = inf;
    for (int i = 1; i <= n; ++i) {
      int t = b[i] - (a[i] >> k);
      if (t == mx) {
        int ad = (1u << k) - (((1u << k) - 1) & a[i]);
        l = std::max(l, ad);
      } else {
        int ad = (1u << k) - 1 - (((1u << k) - 1) & a[i]);
        r = std::min(r, ad);
      }
    }
    if (l > r) continue;
    long long tmp = k + mn;
    for (int t = k; t >= 0; --t) {
      if ((l >> t & 1) != (r >> t & 1)) {
        ++tmp;
        break;
      }
      if (r >> t & 1) ++tmp;
    }
    ans = std::min(ans, tmp);
  }
  if (ans > 1e11) ans = -1;
  printf("%lld\n", ans);
  return 0;
}