这就很水了
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=100005,K=31;
int n,m,tot;
int w,a[N];
int ans;
inline int Gauss(){
int k=1;
for (int p=K;~p;p--)
{
int t=0;
for (int i=k;i<=n && !t;i++) if (a[i]>>p&1) t=i;
if (!t) continue;
swap(a[t],a[k]);
for (int i=1;i<=n;i++)
if (i!=k && a[i]>>p&1)
a[i]^=a[k];
k++;
}
return --k;
}
int main()
{
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(n);
for (int i=1;i<=n;i++) read(a[i]);
tot=Gauss();
for (int i=1;i<=tot;i++)
ans^=a[i];
printf("%d %d\n",ans,ans^a[tot]);
return 0;
}