#include <fstream>
#define NMAX 100010
#define PMAX 21
using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
struct trie
{
trie *fiu[2];
int poz;
trie()
{
fiu[0] = fiu[1] = 0;
poz = 0;
}
};
struct solutie
{
int s, st, dr;
};
int n, v[NMAX];
trie *t = new trie;
solutie sol;
void inserare(trie *nod, int k, int x, int i);
void cautare(trie *a, trie *b, int k, int s);
int main()
{
int i, x;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> x;
v[i] = v[i - 1] ^ x;
inserare(t, (1 << PMAX), v[i], i);
}
sol.dr = n + 5;
cautare(t, t, (1 << PMAX), 0);
fout << sol.s << ' ' << sol.st << ' ' << sol.dr << '\n';
fout.close();
return 0;
}
void inserare(trie *nod, int k, int x, int i)
{
if (!k)
{
if (nod->poz == 0)
nod->poz = i;
return ;
}
if (nod->fiu[(x & k) || 0] == 0)
nod->fiu[(x & k) || 0] = new trie;
inserare(nod->fiu[(x & k) || 0], (k >> 1), x, i);
}
void cautare(trie *a, trie *b, int k, int s)
{
int x, y;
if (!k)
{
x = a->poz;
y = b->poz;
if (x > y)
swap(x, y);
if (s > sol.s || (s == sol.s && y < sol.dr) || (s == sol.s && y == sol.dr && y - (x + 1) < sol.dr - sol.st))
{
sol.s = s;
sol.st = x + 1;
sol.dr = y;
}
return ;
}
if (a->fiu[0])
{
if (b->fiu[1])
{
cautare(a->fiu[0], b->fiu[1], (k >> 1), s + k);
if (a->fiu[1] && b->fiu[0])
cautare(a->fiu[1], b->fiu[0], (k >> 1), s + k);
}
else
{
if (b->fiu[0])
cautare(a->fiu[0], b->fiu[0], (k >> 1), s);
if (a->fiu[1] && b->fiu[1])
cautare(a->fiu[1], b->fiu[1], (k >> 1), s);
}
}
else if (a->fiu[1])
{
if (b->fiu[0])
cautare(a->fiu[1], b->fiu[0], (k >> 1), s + k);
else if (b->fiu[1])
cautare(a->fiu[1], b->fiu[1], (k >> 1), s);
}
}