/*Bismillahir Rahmanir Rahim*///{
#include <bits/stdc++.h>
#include <ext/numeric>
using namespace std; using __gnu_cxx::power;
using ll = long long; using ull = unsigned long long; using ld = long double;
const ll llinf = (1ll<<61)-1; const double eps = 1e-6, ldeps = 1e-9;
struct Dbg { static constexpr auto &os = cout;   // replace by cerr in interactive.
template<class C> static auto dud(C *x)->decltype(os << *x, 0);
template<class C> static char dud(...);
template<class C> typename enable_if<sizeof dud<C>(0)!=1,Dbg&>::type operator<<(const C &x) {os<<x; return *this;}
template<class C> Dbg &dump(C b, C e) {
    for (struct{C i;int j;} i={(*this<<"\n[",b),0}; i.i!=e and i.j<26; i.i++, i.j++) *this<<", "+2*(i.i==b)<<*i.i;
    return *this << ']';
}
template<class C> typename enable_if<sizeof dud<C>(0)==1, Dbg&>::type operator<<(const C &x) {
    return dump(begin(x), end(x));
}
template<class C, size_t X> typename enable_if<!is_same<C, const char>::value, Dbg&>::type operator<<(C (&x)[X]) {
    return dump(begin(x), end(x));
}
template<class B, class C> Dbg &operator<<(const pair<B, C> &x) {return *this<<'{'<<x.first<<", "<<x.second<<'}';}
Dbg &operator<<(ostream&(*x)(std::ostream&)) { os << x; return *this; }
} dbg;
void err(istringstream *iss) { delete iss; }
template<class C, class... Args> void err(istringstream *iss, const C &val, const Args &... args) {
    string name; *iss >> name; if (name.back()==',') name.pop_back();
    dbg << name << " = " << val << "; ", err(iss, args...);
}
#define bug(args...) dbg << __LINE__ << ": ", err(new istringstream(#args), args), dbg << endl
#define cbug(a, args...) if (a) bug(args);
#define ASSERT(a, o, b, args...) if (!((a)o(b))) bug(a, b, ##args), assert((a)o(b));
#define sl(a) int(strlen(a))
#define sz(a) int(a.size())
int T, Q, cn;//}
const int inf = 1000000007, mxn = 53;

#define bin(m) bitset<9>(m)
#define test(m, p) (1&((m)>>(p)))
#define set_(m, p) ((m)|(1ll<<(p)))
#define setb(m, p) m = set_(m, p)
#define reset_(m, p) ((m)&~(1ll<<(p)))
#define resetb(m, p) m = reset_(m, p)
#define toggle_(m, p) ((m)^(1ll<<(p)))
#define toggleb(m, p) m = toggle_(m, p)
#define assign_(m, p, val) (val ? set_(m) : reset_(m))
#define assignb(m, p, val) m = assign_(m, p, val)
#define submask(s, m) s = (s-1)&m
#define getAllSet(p) ((1ll<<(p))-1)
#define allSet(m, p) (m) == getAllSet(p)
ll rol(ll m, int l, int w) { return ((m>>(w-l))|(m<<l))&((1ll<<w)-1); }

int n, a[mxn], b[mxn];
bitset<mxn> canMake[mxn];

signed main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); cout.precision(11);
/*
All possible b can be made by modding by strictly decrasing numbers.
*/
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }

    auto can = [&](ll x)->bool {
        for (int i = 0; i <= 50; i++) {
            canMake[i].reset(), canMake[i][i] = 1;
        }
        for (int i = 50; i >= 1; i--) {
            if (!test(x, i)) continue;
            for (int j = 0; j <= 50; j++) {
                for (int k = 0; k <= 50; k++) {
                    if (canMake[j][k]) {
                        canMake[j][k%i] = 1;
                    }
                }
            }
        }
        for (int i = 1; i <= 50; i++) {
            if (!canMake[a[i]][b[i]]) return 0;
        }
        return 1;
    };

    ll mask = getAllSet(50)<<1;
    if (!can(mask)) return cout << "-1\n", 0;
    for (int i = 50; i >= 1; i--) {
        resetb(mask, i);
        if (!can(mask)) setb(mask, i);
    }

    cout << mask << '\n';
}

Measured memory_bytes: 384