#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;

#define int i64

void solve() {
    int n;
    cin >> n;
    int ans = 1e18;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        cin >> b[i];
    for (int d = 0; d < 30; d++) {
        int l = 0, r = 1e18;
        for (int i = 0; i < n; i++) {
            l = max(l, (b[i] << d) - a[i]);
            r = min(r, ((b[i] + 1) << d) - 1 - a[i]);
        }
        if (l > r) continue;
        int tmp = 1e18;
        if (l >> d == r >> d) {
            for (int now = l; now <= r; now += now & (-now)) {
                tmp = min(tmp,
                          d + (now >> d) + popcount(now & ((1ull << d) - 1)));
            }
        } else {
            int mid = (r >> d) << d;
            for (int now = l; now < mid; now += now & (-now)) {
                tmp = min(tmp,
                          d + (now >> d) + popcount(now & ((1ull << d) - 1)));
            }
            for (int now = mid; now <= r; now += now & (-now)) {
                tmp = min(tmp,
                          d + (now >> d) + popcount(now & ((1ull << d) - 1)));
            }
        }
        ans = min(ans, tmp);
    }
    if (ans >= 1e18) {
        cout << -1 << n;
    } else cout << ans << "\n";
}

#undef int

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}