#include <bits/stdc++.h>
using namespace std;
void printprecise(double l, long long int precision) {
  std::cout << std::fixed;
  std::cout << std::setprecision(precision);
  std::cout << l;
}
long long int power_wm(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long int root(long long int x, vector<long long int> &roots) {
  if (roots[x] != x) roots[x] = root(roots[x], roots);
  return roots[x];
}
void unoin(long long int p, long long int q, vector<long long int> &roots,
           vector<long long int> &rank) {
  long long int rp = root(p, roots);
  long long int rq = root(q, roots);
  if (rank[rq] < rank[rp]) {
    roots[rq] = rp;
  } else if (rank[rp] > rank[rq]) {
    roots[rp] = rq;
  } else {
    roots[rp] = rq;
    rank[rq]++;
  }
}
long long int dig_sum(long long int n) {
  long long int s = 0;
  while (n) {
    s += n % 10;
    n /= 10;
  }
  return s;
}
long long int toD(long long int x, long long int y, long long int m) {
  return x * m + y % m;
}
pair<long long int, long long int> twoD(long long int p, long long int m) {
  return (make_pair(p / m, p % m));
}
vector<long long int> parentof, vis, dist;
vector<vector<long long int> > g;
void dfs(int p) {
  vis[p] = 1;
  for (long long int i = 0; i < g[p].size(); i++) {
    if (vis[g[p][i]] == 0) {
      parentof[g[p][i]] = p;
      dist[g[p][i]] = dist[p] + 1;
      dfs(g[p][i]);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  long long int a = 0, b = 0, c;
  for (long long int i = 0; i < n; i++) {
    cin >> c;
    a |= c;
  }
  for (long long int i = 0; i < n; i++) {
    cin >> c;
    b |= c;
  }
  cout << a + b;
  return 0;
}
