#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
#define all(v) begin(v), end(v)
#define al(v, l, r) begin(v) + l, begin(v) + r + 1
#define pb push_back
#define pob pop_back
#define sz(v) (int)v.size()
#define fs first
#define sd second

constexpr int inf = 2e9;
constexpr ll infll = 4e18;
constexpr int N = 1e5 + 5;
constexpr int B = 21;

int n, a[N], p[N];

struct trie_nod {
    vector<trie_nod*> v;
    int idx = -1;

    trie_nod(): v(2, nullptr) {}
} *rad = new trie_nod();

void insert(int v, int i) {
    trie_nod *nod = rad;
    for (int b = B; b >= 0; --b) {
        int bit = (v >> b) & 1;

        if (!nod->v[bit]) {
            nod->v[bit] = new trie_nod();
        }

        nod = nod->v[bit];
    }

    nod->idx = i;
}

pair<int, int> query(int v) {
    trie_nod *nod = rad;
    int rez = 0;

    for (int b = B; b >= 0; --b) {
        int bit = (v >> b) & 1;

        if (nod->v[bit ^ 1]) {
            rez |= (1 << b);
            nod = nod->v[bit ^ 1];
        } else {
            nod = nod->v[bit];
        }
    }

    return {rez, nod->idx};
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    freopen("xormax.in", "r", stdin);
    freopen("xormax.out", "w", stdout);

    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        p[i] = p[i - 1] ^ a[i];
    }

    insert(0, 0);
    int xr = 0, l = 1, r = 1;

    for (int i = 1; i <= n; ++i) {
        auto [v, idx] = query(p[i]);
        int lc = idx + 1, rc = i;

        if (v > xr || (v == xr && (rc < r || (rc == r && rc - lc < r - l)))) {
            xr = v;
            l = lc;
            r = rc;
        }
        
        insert(p[i], i);
    }

    cout << xr << " " << l << " " << r << "\n";
}