#include <cstdio>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <stack>
#include <iomanip>
#define MOD 1000000007
#define NMAX 100005
#define NRB 21
#define INF (1<<30)

using namespace std;

typedef pair<int, int> pii;

ifstream fin("xormax.in");
ofstream fout("xormax.out");

struct Trie {
    int start;
    Trie *fiu[2];

    Trie() {
        start=0;
        fiu[0]=fiu[1]=NULL;
    }
};

void trie_insert(Trie *node, int start, int pos, int nr);
int trie_query(Trie *node, int pos, int nr);
int sp[NMAX];

int main() {
    int n,i,nr,a,st,dr,xorMax,x;
    Trie *root = new Trie();

    fin>>n;

    xorMax=-1;
    trie_insert(root, 0, NRB, 0);
    for(i=1;i<=n; ++i) {
        fin>>x;
        sp[i]=(sp[i-1]^x);

        a=trie_query(root, NRB, sp[i]);
        int sum=(sp[i]^sp[a]);
        if(sum>xorMax || (sum == xorMax && i<dr) || (sum == xorMax && i==dr && a>st)) {
            xorMax=sum;
            st=a+1;
            dr=i;
        }

        trie_insert(root, i, NRB, sp[i]);
    }

    fout<<xorMax<<' '<<st<<' '<<dr;

    return 0;
}

void trie_insert(Trie *node, int start, int pos, int nr) {
    if(pos == -1) {
        node->start = start;
        return;
    }

    bool bit=nr&(1<<pos);
    if(node->fiu[bit] == NULL)
        node->fiu[bit]=new Trie();

    trie_insert(node->fiu[bit], start, pos-1, nr);
}

int trie_query(Trie *node, int pos, int nr) {
    if(pos == -1)
        return node->start;

    bool bit=(nr&(1<<pos));
    if(!(node->fiu[!bit]))
        return trie_query(node->fiu[bit], pos-1, nr);
    return trie_query(node->fiu[!bit], pos-1, nr);
}