#include <bits/stdc++.h>
#define L 100005
#define BIT_MAX 22
using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");

int n;
int v[L];

struct NODE {
  int valueCnt;
  int prefixCnt;
};

unordered_map <int, NODE> G;
unordered_map <int, int> pos;

void insertOperation(int x) {
  int path = 1;
  for (int bit = BIT_MAX; bit >= 0; bit--) {
    path = path * 2 + (bool)((1 << bit) & x);
    G[path].prefixCnt++;
  }
  G[x].valueCnt++;
}

int prefixOperation(int x) {
  int ans = (1 << (BIT_MAX + 1));
  for (int bit = BIT_MAX; bit >= 0; bit--) {
    int branch;
    if (G[ans + (1 << bit)].prefixCnt == 0)
      branch = 0;
    else if (G[ans].prefixCnt == 0)
      branch = 1;
    else
      branch = 1 - (bool)((1 << bit) & x);
    ans = ans + branch * (1 << bit);
  }
  return ans - (1 << (BIT_MAX + 1));
}

int main(){
  fin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    fin >> x;
    v[i] = (v[i - 1] ^ x);
  }

  int mx = -1, le = -1, ri = -1;
  insertOperation(0);
  pos[0] = 0;
  for (int i = 1; i <= n; i++) {
    int x = prefixOperation(v[i]);
    if (mx < (x ^ v[i])) {
      mx = (x ^ v[i]);
      le = pos[x];
      ri = i;
    }
    insertOperation(v[i]);
    pos[v[i]] = i;
  }
  le++;

  fout << mx << " " << le << " " << ri << "\n";
  return 0;
}