#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
//↓,→,↑,←


#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif

#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;}
vec readvec(ll read) { vec res(read); for(int i=0;i<read;i++){ cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/



struct Timer {
    int64_t start;
    const int64_t CYCLES_PER_SEC = 2800000000;
    Timer() { reset(); }
    void reset() { start = getCycle(); }
    inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
    inline int64_t getCycle() {
        uint32_t low, high;
        __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high));
        return ((int64_t)low) | ((int64_t)high << 32);
    }
};

bool multicase = false;

ll n, m, k, w, a, b, c, d, e, h, q, l;

// canMove[k][i][j]: kまでの数だけで、i -> jに行くことができるか
bool canMove[55][55][55];
// canExist[i][j]: i番目の数が、jとして存在することができるか？
bool canExist[55][55];

void solve() {
    cin >> n;
    vec x(n);
    x = readvec(n);
    vec y(n);
    y  = readvec(n);
    for(int i=0;i<n;i++){
        canExist[i][x[i]] = true;
    }
    for(int j=0;j<=50;j++){
        canMove[0][j][j] = true;
    }
    for(int i=1;i<=50;i++){
        for(int j=0;j<=50;j++){
            for(int k=0;k<=50;k++){
                for(int mid=0;mid<=50;mid++){
                    if (canMove[i][j][k]) break;
                    canMove[i][j][k] = canMove[i-1][j][k] || (canMove[i-1][j][mid] && canMove[i-1][mid % i][k]);
                }
            }
        }
    }
    vec res;
    bool ng = false;
    for(int i=0;i<n;i++){
        if (!canMove[50][x[i]][y[i]]) ng = true;
    }
    if (ng) {
        p(-1);
        return;
    }
    for(int i=50;i>=1;i--){
        bool need = false;
        for(int j=0;j<n;j++){
            bool flag = false;
            for(int k=0;k<=50;k++){
                if (canMove[i-1][k][y[j]] && canExist[j][k]) flag = true;
            }
            if (!flag) need = true;
        }

        if (!need) continue;
        for(int j=0;j<n;j++){
            for(int k=0;k<=50;k++){
                if (canExist[j][k]) {
                    canExist[j][k % i] = true;
                }
            }
        }
        res.pb(i);
    }
    ll ans = 0;
    for(auto e : res){
        ans += (1ll << e);
    }
    p(ans);
}

int main() {
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}



Measured memory_bytes: 3776