#include<bits/stdc++.h>

 using namespace std;

 typedef long long LL;

 const int N =  + ;

 const int m = ;

 LL a[N],b[N];

 int n;

 void build() {

     for (int i=; i<=n; ++i)

         for (int j=m; j>=; --j)

             if ((a[i] >> j) & ) {

                 if (b[j]) a[i] ^= b[j];

                 else {

                     b[j] = a[i];

                     for (int k=j-; k>=; --k) if (b[k]&&((b[j]>>k)&)) b[j] ^= b[k];

                     for (int k=j+; k<=m; ++k) if ((b[k]>>j)&) b[k] ^= b[j];

                     break;

                 }

             }

 }

 void solve() {

     LL mn = 1e18,ans = ;

     for (int i=; i<=m; ++i)

         if (b[i]) {

             ans ^= b[i];

             mn = min(mn,b[i]);

         }

     cout << ans << " ";

     ans ^= mn;

     cout << ans;

 }

 int main() {

     scanf("%d",&n);

     for (int i=; i<=n; ++i) scanf("%d",&a[i]);

     build();

     solve();

     return ;

 }