**题目链接:**https://www.luogu.org/problem/P1247
#include<iostream>
#include<cstdio>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
#define ll int
using namespace std;
int maxn,maxnum;
int n;
int aa[500005];
int bb[500005];
int num=0;
int yihuo=0;
int second,secondnum;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>aa[i];
num^=aa[i];
}
if(!num)
{
cout<<"lose"<<endl;
return 0;
}
else{
for(int i=1;i<=n;i++)
{
if((aa[i]^num)<aa[i])
{
cout<< aa[i]-(aa[i]^num)<<" "<<i<<endl;
for(int j=1;j<=n;j++)
{
if(j!=i)
{
//cout<<"98"; cout<<"o";
cout<<aa[j]<<" ";
}
else
{
int r=aa[i]^num;
cout<<r<<" ";
}
}break;
}
}
}
}