CodeForces 631A--Interview

D - Interview

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 631A

Description

Blake is a CEO of a large company called "Blake Technologies". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the interview that consists of the following problem.

We define function f(x, l, r) as a bitwise OR of integers x_l, x_l + 1, ..., x_r, where x_i is the i-th element of the array x. You are given two arrays a and b of length n. You need to determine the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the length of the arrays.

The second line contains n integers a_i (0 ≤ a_i ≤ 10⁹).

The third line contains n integers b_i (0 ≤ b_i ≤ 10⁹).

Output

Print a single integer — the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.

Sample Input

Input

51 2 4 3 22 3 3 12 1

Output

22

Input

1013 2 7 11 8 4 9 8 5 15 7 18 9 2 3 0 11 8 6

Output

46

题目大意；给两个序列求第一个序列进行“|”运算之后加起来的和。

AC代码：

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){__int64  n,a[1010],b[1010];while(scanf("%I64d",&n)!=EOF){__int64  aa,bb;for(__int64  i=1;i<=n;i++){scanf("%I64d",&a[i]);if(i==1){aa=a[i];continue ;}aa=max(aa,aa|a[i]);}for(__int64  i=1;i<=n;i++){scanf("%I64d",&b[i]);if(i==1){bb=b[i];continue ;}bb=max(bb,bb|b[i]);}printf("%I64d\n",aa+bb);}return 0;}