#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename Container>
int SZ(const Container& S) { return S.size(); }

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

template <typename T>
ostream& operator <<(ostream& out, const vector<T>& v) {
    out << "[";
    for (int i = 0; i < (int)v.size(); i++) {
        out << v[i];
        if (i != (int)v.size()-1) out << ", ";
    }
    out << "]";
    return out;
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg_var(x) clog << #x  << ": " << x << endl;
    #define dbg_array(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg_var(x)
    #define dbg_array(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////

const int MAXN = 50; 
int din[MAXN+1][MAXN+1];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!
    for (int a = 0; a <= MAXN; a++) for (int b = 0; b <= MAXN; b++) {
		if (a == b) continue;
		din[a][b] = 2*MAXN;
		for (int k = 1; k <= MAXN; k++) din[a][b] = min(din[a][b], max(k, din[a%k][b]));
	}
	//~ for (int b = 0; b <= MAXN; b++) {
		//~ dbg_var(b);
		//~ for (int i = 0; i <= MAXN; i++) cout << din[i][b] << " ";
		//~ cout << endl;
	//~ }
	int N;
	cin >> N;
	vector<set<int>> a(N);
	vector<int> b(N);
	for (int i = 0; i < N; i++) {
		int x;
		cin >> x;
		a[i].insert(x);
	}
	for (int i = 0; i < N; i++) cin >> b[i];
	for (int i = 0; i < N; i++) {
		if (din[*(a[i].begin())][b[i]] > MAXN) {
			cout << "-1\n";
			return 0;
		}
	}
	LL res = 0;
	for (int k = MAXN; k >= 1; k--) {
		bool used = false;
		for (int i = 0; i < N; i++) {
			int ris = MAXN;
			for (int x : a[i]) ris = min(ris, din[x][b[i]]);
			if (ris == k) used = true;
		}
		if (used) {
			res += 1ll<<k;
			for (int i = 0; i < N; i++) {
				set<int> new_set;
				for (int x : a[i]) {
					if (din[x][b[i]] < k) new_set.insert(x);
					if (din[x%k][b[i]] < k) new_set.insert(x%k);
				}
				a[i] = new_set;
			}
		}
	}
	cout << res << "\n";
}



Measured memory_bytes: 256