#include <bits/stdc++.h>
#define NMAX 100005
 
using namespace std;
 
struct trie {
    int number;
    trie *next[2];
};
 
int xp[NMAX];
 
void add_trie(trie *root, int value)
{
    trie *aux = root;
    for (register int bit = 20; bit >= 0; --bit)
        if (value & (1 << bit)) {
            
            if (!aux->next[1]) {
                aux->next[1] = (trie *) calloc(1, sizeof(trie));
            }
            
            aux->next[1]->number = ((aux->number << 1) ^ 1);
            aux = aux->next[1];
 
        } else {
 
            if (!aux->next[0]) {
                aux->next[0] = (trie *) calloc(1, sizeof(trie));
            }
 
            aux->next[0]->number = (aux->number << 1);
            aux = aux->next[0];
        }
}
 
pair <int, int> search(trie *node1, trie *node2)
{
    if (node1->next[0] && node1->next[1] && node2->next[0] && node2->next[1]) {

        pair<int, int> ans1 = search(node1->next[0], node2->next[1]);
        pair<int, int> ans2 = search(node1->next[1], node2->next[0]);

        if ((ans1.first ^ ans1.second) >= (ans2.first ^ ans2.second)) {
            return ans1;
        } else {
            return ans2;
        }

    } else if (node1->next[0] && node2->next[1]) {

        return search(node1->next[0], node2->next[1]);

    } else if (node1->next[1] && node2->next[0]) {

        return search(node1->next[1], node2->next[0]);

    } else if (node1->next[0] && node2->next[0]) {

        return search(node1->next[0], node2->next[0]);

    } else if (node1->next[1] && node2->next[1]) {

        return search(node1->next[1], node2->next[1]);

    }

    return {node1->number, node2->number};
}
 
int main()
{
    freopen("xormax.in", "r", stdin);
    freopen("xormax.out", "w", stdout);
 
    int n;
    scanf("%d", &n);
 
    for (register int i = 1, x; i <= n; ++i) {
        scanf("%d", &x);
        xp[i] = xp[i - 1] ^ x;
    }
 
    trie *root;
    root = (trie *) calloc(1, sizeof(trie));
    for (register int i = 0; i <= n; ++i)
        add_trie(root, xp[i]);
 
    pair <int, int> values = search(root, root);
 
    int l = -1, r = -1;
    for (register int i = 0; i <= n; ++i)
        if (xp[i] == values.first) {
            l = i;
        } else if (xp[i] == values.second) {
            r = i;
        }
 
    if (l > r)
        swap(l, r);

    ++l;

    printf("%d %d %d\n", (xp[r] ^ xp[l - 1]), l, r);
    return 0;
}