#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int main(){
    int N; cin >> N;
    vector<int> a(N),b(N);
    rep(i,N) cin >> a[i];
    rep(i,N) cin >> b[i];

    ll ans=0;
    for(int i=50;i>=1;i--){
        vector<vector<ll>> G(51,vector<ll>(51,LINF));
        for(int i=0;i<=50;i++) G[i][i]=0;

        // 既に確定している値でグラフ構築
        for(int j=50;j>i;j--){
            if(ans&(1ll<<j)){
                for(int k=0;k<=50;k++){
                    G[k][k%j]=(1ll<<j);
                }
            }
        }
        // i未満の値でグラフ構築
        for(int j=i-1;j>=1;j--){
            for(int k=0;k<=50;k++){
                G[k][k%j]=(1ll<<j);
            }
        }


        for(int k=0;k<=50;k++){
            for(int ii=0;ii<=50;ii++){
                for(int jj=0;jj<=50;jj++){
                    G[ii][jj] = min(G[ii][jj],G[ii][k]+G[k][jj]);
                }
            }
        }

        bool ok = true;
        for(int j=0;j<N;j++){
            if(G[a[j]][b[j]]==LINF){
                ok = false;
                break;
            }
        }

        if(!ok){
            ans |= (1ll << i);
        }
    }


     // 実際に構築して確認
    vector<vector<ll>> G(51,vector<ll>(51,LINF));
    for(int i=0;i<=50;i++) G[i][i]=0;
    for(int i=0;i<=50;i++){
        if(ans & (1ll<<i)){
            for(int j=0;j<=50;j++){
                G[j][j%i]=(1ll<<j);
            }
        }
    }
    for(int k=0;k<=50;k++){
        for(int i=0;i<=50;i++){
            for(int j=0;j<=50;j++){
                G[i][j] = min(G[i][j],G[i][k]+G[k][j]);
            }
        }
    }

    for(int i=0;i<N;i++){
        if(G[a[i]][b[i]]==LINF){
            cout << -1 << endl;
            return 0;
        }
    }

    cout << ans << endl;
}


Measured memory_bytes: 256