#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	V<int> a(N),b(N);
	for(int i  = 0; i < N; ++i) cin >> a[i];
	for(int i  = 0; i < N; ++i) cin >> b[i];
	ll ini = LLINF/10;
	V<V<ll>> dp(N,V<ll>(51,ini));
	for(int i  = 0; i < N; ++i) dp[i][a[i]] = 0;
	ll ans = 0;

	for(int n = 0; n < 50; ++n){
		auto dp2 = dp;
		for(ll k = 50; 1 <= k; --k){
			for(int i = 0; i < N; ++i){
				auto tmp = dp2[i];
				for(int j = 50; 0 < j; --j){
					chmin(tmp[j%k],tmp[j]+(1LL<<k));
				}
				dp2[i] = tmp;
			}
		}
		V<ll> c(N);
		for(int i = 0; i < N; ++i) c[i] = dp2[i][b[i]];
		for(int i = 0; i < N; ++i) corner(c[i] == ini,-1);
		ll maxi = *max_element(ALL(c));
		ll cost = -1;
		for(ll i = 0; i < 60; ++i) if(maxi & (1LL<<i)) cost = i;
		if (cost > 0) ans |= (1LL<<cost);
		if (cost==0) break;
		for(int i = 0; i < N; ++i){
			auto tmp = dp[i];
			for(int j = 50; 0 < j; --j){
				chmin(tmp[j%cost],tmp[j]);
			}
			dp[i] = tmp;
		}
	}
	cout << ans << endl;
	return 0;
}


Measured memory_bytes: 256