#include <stdio.h>
int a[100001]; 

int keres(int kezd,int vege)
{
  int ered=a[kezd];
     for(int k=kezd+1;k<=vege;k++)
       ered^=a[k];
   return(ered);
   
}
     
int main()
{
  FILE *in,*out;
  in=fopen("xormax.in","r");
  long n;  
  fscanf(in,"%ld",&n);

  for(int i=1;i<=n;i++)  
    fscanf(in,"%d",&a[i]);
 
 long eleje,vege,ered,max=0;
  for(int i=1;i<n;i++)
  
   for(int j=n;j>i;j--)
   {  
     ered=keres(i,j);      
       
    if(ered>max){
                 eleje=i;
                 vege=j;
                 max=ered;
                 }
   else if(ered==max)
          if(eleje>i){eleje=i;vege=j;}
        
                       
  } 
    
 out=fopen("xormax.out","w");
 fprintf(out,"%ld ",max);   
 fprintf(out,"%ld ",eleje);    
 fprintf(out,"%ld",vege); 
     
}