// #define _GLIBCXX_DEBUG 
#include<bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;

#define CIN( LL , A ) LL A; cin >> A 
#define GETLINE( A ) string A; getline( cin , A ) 
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR ) 
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( ll VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; return 0 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << "\n"; return 0 
#define MIN( A , B ) A < B ? A : B;
#define MAX( A , B ) A < B ? B : A;

template <typename T> inline T Absolute( const T& a ){ return a > 0 ? a : - a; }

int main()
{
  UNTIE;
  CIN( ll , N );
  constexpr const ll power = 65536;
  constexpr const ll digit = 16;
  if( N >= digit ){
    RETURN( power - 1 );
  }
  constexpr const ll shift = power / 2;
  ll Ai;
  bool c[power] = {};
  ll max = -1;
  if( N == 1 ){
    cin >> Ai;
    REPEAT( digit ){
      if( c[Ai] ){
	if( max < Ai ){
	  max = Ai;
	}
      }
    }
    Ai = shift * ( Ai % 2 ) + Ai / 2;
  } else {
    ll answer[power];
    ll size_new = 0;
    {
      cin >> Ai;
      REPEAT( digit ){
	if( ! c[Ai] ){
	  c[Ai] = true;
	  answer[size_new] = Ai;
	  size_new++;
	}
	Ai = shift * ( Ai % 2 ) + Ai / 2;
      }
    }
    ll size = size_new;
    ll answer_new;
    FOR( i , 2 , N ){
      cin >> Ai;
      size_new = size;
      REPEAT( digit ){
	FOR( j , 0 , size ){
	  answer_new = answer[j] | Ai;
	  if( ! c[answer_new] ){
	    c[answer_new] = true;
	    answer[size_new] = answer_new;
	    size_new++;
	  }
	}
	Ai = shift * ( Ai % 2 ) + Ai / 2;
      }
      size = size_new;
    }
    {
      cin >> Ai;
      REPEAT( digit ){
	FOR( j , 0 , size ){
	  answer_new = answer[j] | Ai;
	  if( ! c[answer_new] ){
	    if( max < answer_new ){
	      max = answer_new;
	    }
	  }
	}
	Ai = shift * ( Ai % 2 ) + Ai / 2;
      }
    }
  }
  RETURN( max );
}