#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, a[N], b[N];
inline int Calc(int k, int a1) {
    int mn = 0, mx = (1 << k) - 1;
    for (int i = 1; i <= n; ++i) {
        int na = a[i] >> k;
        int target = b[i] - b[1] + a1;
        // printf("%d %d\n", na, target);
        if (target != na && target != na + 1) return 2e9;
        int val = a[i] & ((1 << k) - 1);
        if (target == na) mx = min(mx, (1 << k) - val - 1);
        else mn = max(mn, (1 << k) - val);
        // printf("=> %d %d\n", mn, mx);
        if (mn > mx) return 2e9;
    }
    // printf("%d %d\n", mn, mx);
    int ans = 0;
    for (int i = k - 1; ~i; --i) {
        if ((mx >> i & 1) == (mn >> i & 1)) ans += (mx >> i & 1);
        else { ++ans; break; }
    }
    return ans;
}
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);
    int ans = 2e9;
    for (int i = 0; i <= 30; ++i) {
        for (int d = 0; d < 2; ++d) {
            int na = a[1] >> i;
            if (na + d <= b[1]) ans = min(ans, i + b[1] - (na + d) + Calc(i, na + d)); 
        }
    }
    if (ans == 2e9) ans = -1;
    printf("%d\n", ans);
    return 0;
}