#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ull, ull> pull;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);

ifstream fin("xormax.in");
ofstream fout("xormax.out");
 
int nums[100010], pre[100010];
unordered_set<int> in;
int idx[2100010];
int main()
{
    int n, cur = 0, mx1 = 0, mx2 = 0, l, r;
    fin >> n;
    for(int i = 0; i < n; i ++)
        fin >> nums[i];
    pre[0] = 0;
    for(int i = 1; i <= n; i ++)
        pre[i] = pre[i-1] ^ nums[i-1];
    n++;
    for(int i = 21; i >= 0; i --)
    {
        in.clear();
        cur = cur | (1<<i);
        for(int i = 0; i < n; i ++)
            in.insert(cur & pre[i]), idx[cur & pre[i]] = min(idx[cur & pre[i]], i);
        mx2 = mx1 | (1<<i);
        for(auto it : in)
            if(in.find(it ^ mx2) != in.end())
            {
                mx1 = mx2;
                r = idx[it], l = idx[it^mx2];
                break;
            }
    }
    if(l > r) swap(l, r);
    l++;
    fout << mx1 << " " << l << " " << r << "\n";
}