#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

bool dp[16][1<<16];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    if(n >= 16){
        cout << (1<<16)-1 << endl;
    }
    else{
        dp[0][0] = true;
        int res = 0;
        for(int i=0;i<n;i++){
            for(int j=0;j<(1<<16);j++){
                if(!dp[i][j]) continue;
                int l = a[i];
                for(int k=0;k<16;k++){
                    dp[i+1][l|j] = true;
                    l = l/2 + (l%2)*(1<<15);
                }
            }
        }
        for(int i=0;i<(1<<16);i++){
            if(dp[n][i]) res = i;
        }
        cout << res << endl;
    }
}