#include<stdio.h>

long v[1024000], n, max, maxx, i, tmp;

int main()
{
	freopen("xormax.in", "r", stdin);
	freopen("xormax.out", "w", stdout);
	
	scanf("%ld", &n);
	for (i=1; i<=n; i++)
	{
		scanf("%ld", &tmp);
		v[i]=v[i-1]^tmp;
		if (v[i]>v[max]) max=i; 
	}
	maxx=max;
	for (i=1; i<=n; i++)
		if ((v[i]^v[max]) > (v[maxx]^v[max])) maxx=i;
	
	//for (i=1; i<=n; i++)
	//	printf("%ld ", v[i]);
	
	if (max>maxx)
		printf("%ld %ld %ld", v[max]^v[maxx], maxx+1, max);
	else
		printf("%ld %ld %ld", v[max]^v[maxx], max+1, maxx);
	
	return 0;
}