#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
int b[22], poz, y[100001];

struct nod{
    int p;
    nod * x[2];
};

void Update(nod * & R, int p, int i)
{if(R==NULL)
 {R=new nod;
  R->x[1]=R->x[0]=NULL;
  R->p=0;
 }

 if(i<21)Update(R->x[b[i+1]], p, i+1);
 else R->p=p;
}

void Query(nod *R, int i)
{if(i<21)
 {if(R->x[!b[i+1]]!=NULL)Query(R->x[!b[i+1]], i+1);
  else Query(R->x[b[i+1]], i+1);
 }
 else poz=R->p;
}

int main()
{   nod *R=NULL;
    int n, a, maxi=0, i1=1, i2=1, sum=0;
    fin>>n;
    for(int i=1;i<=n;i++)
    {fin>>a;
     sum^=a;
     y[i]=sum;

     for(int j=1;j<=21;j++)
     b[j]=0;

     int ca=sum, k=22;
     while(ca!=0)
     {b[--k]=ca%2;
      ca/=2;
     }

     if(i!=1)
     {Query(R, 0);
      if(sum^y[poz]>maxi)maxi=sum^y[poz], i1=poz+1, i2=i;
     }
     Update(R, i, 0);
    }
    fout<<maxi<<" "<<i1<<" "<<i2;
    return 0;
}