1 #include<bits/stdc++.h>
 2 using namespace std;
 3 typedef long long LL;
 4 
 5 const int N = 100000 + 10;
 6 const int m = 30;
 7 LL a[N],b[N];
 8 int n;
 9 
10 void build() {
11     for (int i=1; i<=n; ++i) 
12         for (int j=m; j>=0; --j) 
13             if ((a[i] >> j) & 1) {
14                 if (b[j]) a[i] ^= b[j];
15                 else {
16                     b[j] = a[i];
17                     for (int k=j-1; k>=0; --k) if (b[k]&&((b[j]>>k)&1)) b[j] ^= b[k];
18                     for (int k=j+1; k<=m; ++k) if ((b[k]>>j)&1) b[k] ^= b[j];
19                     break;
20                 }
21             }
22 }
23 void solve() {
24     LL mn = 1e18,ans = 0;
25     for (int i=0; i<=m; ++i) 
26         if (b[i]) {
27             ans ^= b[i];
28             mn = min(mn,b[i]);
29         }
30     cout << ans << " ";
31     ans ^= mn;
32     cout << ans;
33 }
34 int main() {
35     scanf("%d",&n);
36     for (int i=1; i<=n; ++i) scanf("%d",&a[i]);
37     build();
38     solve();    
39     return 0;
40 }