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

typedef long long ll;
#define int ll
#define ln '\n'
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
const int INF = 1e9+7;

int n;
vi a, aa, b;

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    a.resize(n);
    aa.resize(n);
    b.resize(n);
    rep(i, 0, n)
        cin >> aa[i];
    rep(i, 0, n)
        cin >> b[i];
    int ans = INF;
    rep(k, 0, 32) {
        rep(i, 0, n)
            a[i] = aa[i];
        bool flag = false;
        rep(i, 0, n)
            if(a[i] >= (b[i]+1)*(1LL << k))
                flag = true;
        if(flag)
            continue;
        int m = (1LL << k);
        int cur = 0;
        bool good = true;

        int need1 = INF, need2 = 0;
        rep(i, 0, n) {
            need1 = min(need1, max(0LL, (b[i]*(1LL << k) + (1LL << k) - 1 - a[i]))/m);
            need2 = max(need2, max(0LL, (b[i]*(1LL << k) + m - 1 - a[i]))/m);
        }
        int need = min(need1, need2);
        good = true;
        rep(i, 0, n) {
            a[i] += need*m;
            if(a[i] < (b[i] << k))
                good = false;
        }
        cur += need;
        if(good) {
            ans = min(ans, cur);
        } else {
            m >>= 1;
            int mn = INF, mx = 0;
            rep(i, 0, n) {
                mn = min(mn, ((b[i]+1) << k) - a[i]);
                mx = max(mx, (b[i] << k) - a[i]);
            }
            while(m) {
                if(m < mn) {
                    mn -= m;
                    mx -= m;
                    cur++;
                }
                good = false;
                if(mx <= 0)
                    good=true;
                m >>= 1;
            }
        }
        if(good) {
            ans = min(ans, cur + k);
        }
    }
    if(ans == INF)
        cout << -1 << ln;
    else 
        cout << ans << ln;
	return 0;
}