#include <bits/stdc++.h>
using namespace std;

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

int sor[100001];

int main()
{
    int n, max1 = -1, x, st, dr;
    in >> n;
    for(int i = 1; i <= n; i++)
    {
        in >> x;
        sor[i] = sor[i - 1] ^ x;
    }
    for(int i = 1; i <= n; i++)
        for(int j = i - 1; j >= 0; j--)
            if((sor[i] ^ sor[j]) > max1)
            {
                max1 = sor[i] ^ sor[j];
                st = j + 1;
                dr = i;
            }
    out << max1 << " " << st << " " << dr;
    return 0;
}