#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
ifstream fin("xormax.in"); ofstream fout("xormax.out");
#define cin fin
#define cout fout

int t, n, m, k, a[100010];
int trie[2000010][2][2], l=1;
vector<int> c[2100000];




void trie_insert(int x){
int crd=1;
int pr, ac;
for(int i=20; i>=1; i--){

ac=( ((1<<(i-1) )&x)>0 )?1:0;
pr=( (( 1<<(i))&x)>0 )?1:0;



if(trie[crd][pr][ac]==0 ){
    trie[crd][pr][ac]=l+1; l++;
    crd=l;
}
else{
 crd=trie[crd][pr][ac];
}

}


}






int trie_find(int x){
int res=0;


int pr=( (x&(1<<20))?1:0 );
int crd=1;


for(int i=20; i>=1; i--){

    int ac=(( (1<<(i-1) )&x  )>0)?1:0;

    if(trie[crd][pr][ac]==0){
        ac=((ac==1)?0:1);
        if(trie[crd][pr][ac]==0){
            pr=((pr==1)?0:1);
        }
    }
    if(i==20){
        res+=((pr==1)?( (1<<i)):0  );
    }
    crd=trie[crd][pr][ac];

    pr=ac;
    res+=(pr==1)?(1<<(i-1)):0;
}


return res;
}






int32_t main(){
INIT
cin>>n;
a[0]=0;
c[0].pb(0);
for(int i=1; i<=n; i++){
    cin>>a[i];
    a[i]^=a[i-1];
    trie_insert(a[i]);
    c[a[i] ].pb(i);
}
trie_insert(0);



int m=0;
int c1=0, c2=0;
for(int i=1; i<=n; i++){
    int a2=trie_find(~a[i]);


    int l=0, r=c[a2].size()-1, mij=(l+r)/2;

    while(l<r){
    mij=(l+r)/2;
    if(c[a2][mij]>=i ){
        r=mij;
    }
    else{
        l=mij+1;
    }
    mij=(l+r)/2;
    }



    int d2=abs(c[a2 ][mij]-i);
    int d1=10e8;
    if(mij>0){
        d1=abs(c[a2 ][mij-1]-i);
    }
    if(d1<=d2){
        mij--;
    }
    int c3=c[a2][mij]; int c4=i;
    int t=c3; c3=min(c3, c4); c4=max(t, c4);


    if( (a2^a[i])==m ){
        if(c4==c2){
            c1=max(c3, c1);
        }
        if(c4<c2){
            c1=c3; c2=c4;
        }
    }


    if( (a2^a[i])>m ){
        m=a2^a[i];
        c2=c4; c1=c3;
    }


    t=c1; c1=min(c1, c2); c2=max(t, c2);


}
cout<<m<<" "<<c1+1<<" "<<c2;




return 0;
}