#include<stdio.h>

long long a[200005], n, pi, pf, max, xor1, xor2;

int main()
{
  long i, j;
  freopen("xormax.in","r",stdin);
  freopen("xormax.out","w",stdout);
  max=-1;
  scanf("%lld",&n);
  for (i = 1; i <= n; i++) scanf("%lld",&a[i]);
  pi=i;
  for (i = 1; i < n; i++)
  { xor1=a[i+1]; 
    if (xor1^a[i]) { xor2=(xor1^a[j]);
	             if (xor2>max) {pf=i; max=xor2;}
		     xor1=xor2; }
      else {pi=i; xor1=a[i];} 
  }
  printf("%lld %lld %lld",max,pi,pf);
  return 0;
}