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

int n;
int v[L];

struct NODE {
  int valuePos;
  int prefixCnt;
};

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

void insertOperation(int x, int ind) {
  string path = "";
  for (int bit = BIT_MAX; bit >= 0; bit--) {
    path += ('0' + (bool)((1 << bit) & x));
    G[path].prefixCnt++;
  }
  G[path].valuePos = ind;
}

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

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, 0);
  //pos[0] = 0;
  for (int i = 1; i <= n; i++) {
    int ind = prefixOperation(v[i]);
    int x = v[ind];
    if (mx < (x ^ v[i])) {
      mx = (x ^ v[i]);
      le = ind;
      //le = pos[x];
      ri = i;
    }
    insertOperation(v[i], i);
    //pos[v[i]] = i;
  }
  le++;

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