#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int inf = 2e9 + 10;
const int N = 1e6 + 10;
const int B = 31;
int a[N], b[N];
int a2[N][B];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    int ans = inf;

    for (int i = 1; i <= n; i++) {
        a2[i][0] = a[i];
        for (int j = 1; j <= B - 1; j++) {
            a2[i][j] = a2[i][j - 1] >> 1;
        }
    }

    for (int divs = 0; divs <= B - 1; divs++) {
        int mn = inf, mx = 0;
        for (int i = 1; i <= n; i++) {
            mn = min(mn, b[i] - a2[i][divs]);
            mx = max(mx, b[i] - a2[i][divs]);
        }
        if (mn < 0) {
            continue;
        } else {
            for (int j = 0; j <= divs; j++) {
                bool ok = true;
                int x = -1;
                for (int i = 1; i <= n; i++) {
                    int y = a2[i][divs - j];
                    for (int kk = 1; kk <= j; kk++) {
                        y = (y + 1) >> 1;
                    }
                    if (y > b[i]) {
                        ok = false;
                        break;
                    } else {
                        if (x == -1) {
                            x = b[i] - y;
                        } else if (x != b[i] - y) {
                            ok = false;
                        }
                    }
                }
                if (ok) {
                    ans = min(ans, divs + x + j);
                }
            }
        }
    }

    if (ans == inf) {
        cout << "-1\n";
    } else {
        cout << ans << "\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}