def main(): n = int(input()) A = list(map(int, input().split())) def make(s): Ans = [A[s]] X = [1] * n X[s] = 0 for _ in range(n-1): t = -1 idx = -1 for i in range(n): if not X[i]: continue if Ans[-1]^A[i] > t: t = Ans[-1]^A[i] idx = i Ans.append(A[idx]) X[idx] = 0 return Ans B = [make(i) for i in range(n)] C = [[B[i][j]^B[i][j+1] for j in range(n-1)] for i in range(n)] I = [i for i in range(n)] I.sort(key = lambda x: (C[x], B[x])) return B[I[-1]] print(*main())