#include <stdio.h>

int n,i,j,a[100010],max,l,r;

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