#include <bits/stdc++.h>

using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
const int Nmax=  100000 + 5;
int s[Nmax], x, xormax = -1, n, beg, finl;
struct trie
{
    trie *fiu[2];
    int terminal;
    trie()
    {
        fiu[0] = 0;fiu[1] = 0;
        terminal = 0;
    }
};
trie *t = new trie;
void adauga(trie *nod, int put, int nr, int prov)
{
    bool bit = (1 << put) & nr;
    if(put == -1)
    {
        nod->terminal = prov;
        return;
    }
    if(nod ->fiu[bit] == 0)nod -> fiu[bit] = new trie;
    adauga(nod->fiu[bit], put - 1, nr, prov);
}
int cauta(trie *nod, int put, int nr)
{
    if(put == -1)return nod->terminal;
    bool bit = nr & (1 << put);
    if(nod->fiu[!bit] == 0)
        return cauta(nod->fiu[bit], put - 1, nr);
    return cauta(nod->fiu[!bit], put -1, nr);
}
int main()
{
    adauga(t, 21,0, 0);
    fin >> n;
    for(int i = 1, a; i <= n; ++i)
    {
        fin >> a;
        s[i] = s[i - 1] ^ a;
        int poz = cauta(t, 21, s[i]);
        x = s[i] ^ s[poz];
        if(xormax < x)
        {
            xormax = x;
            beg = poz + 1;
            finl = i;
        }
        adauga(t, 21, s[i], i);
    }
    fout << xormax << " " << beg << " " << finl;
    return 0;
}