#include <iostream>
#include <fstream>

using namespace std;

class Node {
public:
	Node() :
		left(0),
		right(0),
		idx(0)
	{
	}

	Node *left, *right;
	int idx;
};

int A[100001];
int N;
Node root;

void insert_into_trie(int cur, int idx) {
	int i = 1 << 22;

	Node *n = &root;
	while (i > 0) {
		if (i & cur) {
			if (!n->right)
				n->right = new Node;
			n = n->right;
		} else {
			if (!n->left)
				n->left = new Node;
			n = n->left;
		}

		i >>= 1;
	}
	n->idx = idx;
}

int find_in_trie(int cur) {
	int i = 1 << 22;

	Node *n = &root;
	while (i > 0) {
		if (i & cur) {
			if (n->left)
				n = n->left;
			else
				n = n->right;
		} else {
			if (n->right)
				n = n->right;
			else
				n = n->left;
		}

		i >>= 1;
	}
	
	return n->idx;
}

#define MIN(a, b) ((a > b) ? (b) : (a))
#define MAX(a, b) ((a > b) ? (a) : (b))

int main(int argc, char *argv[]) {
	FILE *fi = fopen("xormax.in", "r");
	fscanf(fi, "%d", &N);
	int aux;
	insert_into_trie(0, 0);
	int largest(-1),
		ms, mf;
	for (int i(1); i <= N; ++i) {
		fscanf(fi, "%d", &aux);
		A[i] = A[i-1] ^ aux;
		aux = find_in_trie(A[i]);
//		cout << A[i] << " " << A[aux] << " -> " << A[i] << endl;
		if (aux != -1)
			if (A[i] ^ A[aux] > largest) {
				largest = A[i] ^ A[aux];
				ms = aux;
				mf = i;
			}
		//cout << cur << endl;
		insert_into_trie(A[i], i);
	}
	fclose(fi);

	ofstream fout("xormax.out");
	fout << (A[ms] ^ A[mf]) << " " << MIN(ms, mf) + 1 << " " << MAX(ms, mf) << endl;
	fout.close();

	return 0;
}