/*
Catalin-Stefan Tiseanu
Pre-written code is assembled from various sources found online.
Big thanks to the community for that !
*/
// Pre-written code below
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <unordered_map>
//START_CLEAN
// always remove
//START:mandatory
//#define DEBUG
#ifndef NDEBUG
# define assert_msg(condition, message) \
do { \
if (! (condition)) { \
std::cerr << "Assertion `" #condition "` failed in " << __FILE__ \
<< " line " << __LINE__ << ": " << message << std::endl; \
std::exit(EXIT_FAILURE); \
} \
} while (false)
#else
# define ASSERT(condition, message) do { } while (false)
#endif
#ifdef DEBUG
#define debug(args...) {dbg,args; cerr<<endl;}
#else
#define debug(args...) // Just strip off all debug tokens
#endif
template<class T> std::ostream& operator <<(std::ostream& stream, const vector<T> & v) {
for (auto el : v)
stream << el << " ";
return stream;
}
template<class T> std::ostream& operator <<(std::ostream& stream, const vector<vector<T>> & v) {
for (auto line : v) {
for (auto el : line)
stream << el << " ";
stream << endl;
}
return stream;
}
template<class T, class U> std::ostream& operator <<(std::ostream& stream, const pair<U, T> & p) {
stream << "( " << p.first << ", " << p.second << " )";
return stream;
}
class debugger {
public:
template<class T> void output (const T& v) {
cerr << v << " ";
}
template<class T> debugger& operator , (const T& v) {
output(v);
return *this;
}
} dbg;
//END:mandatory
////////////////
// templates //
////////////////
// general
//template size
template<typename T> int size(const T& c) { return int(c.size()); }
//template abs
template<typename T> T abs(T x) { return x < 0 ? -x : x; }
//template sqr
template<typename T> T sqr(T x) { return x*x; }
//template remin
template<typename T> bool remin(T& x, T y) { if (x <= y) return false; x = y; return true; }
//template remax
template<typename T> bool remax(T& x, T y) { if (x >= y) return false; x = y; return true; }
//template factorize
template<class T> inline vector<pair<T,int> > factorize(T n) {vector<pair<T,int> > R;for (T i=2;n>1;){if (n%i==0){int C=0;for (;n%i==0;C++,n/=i);R.push_back(make_pair(i,C));} i++;if (i>n/i) i=n;}if (n>1) R.push_back(make_pair(n,1));return R;}
//template toStr
template<typename T> string toStr(T x) { stringstream ss; ss << x; return ss.str(); }
// misc
#define EPS 1e-5
// types
//template int64
typedef long long int64 ;
//template uint64
typedef unsigned long long uint64 ;
// shortcuts
#define all(_xx) _xx.begin(), _xx.end()
#define pb push_back
#define vi vector<int>
#define vs vector<string>
#define vvi vector<vector<int>>
#define vd vector<double>
#define vpii vector<pair<int,int> >
#define vpdd vector<pair<double,double> >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pdd pair<double, double>
#define mp(XX, YY) make_pair(XX, YY)
#define fi first
#define se second
#define ll long long
#define SS stringstream
// for loops
#define re(II, NN) for (int II(0), _NN(NN); (II) < (NN); ++(II))
#define fod(II, XX, YY) for (int II(XX), _YY(YY); (II) >= (_YY); --(II))
#define fo(II, XX, YY) for (int II(XX), _YY(YY); (II) <= (_YY); ++(II))
#define foreach(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
// Useful hardware instructions
#define bitcount __builtin_popcount
#define gcd __gcd
// Useful all around
#define checkbit(n,b) ( (n >> b) & 1)
#define DREP(a) sort(a.begin(), a.end());a.erase(unique(a.begin(), a.end()),a.end())
#define INDEX(arr,ind) (lower_bound(arr.begin(), arr.end(),ind)-arr.begin())
#define PAUSE cerr << "Press any key to continue ..."; char xxxx; scanf("%c", &xxxx);
#define fill(xx,val) memset(xx, val, sizeof(xx))
struct Scanner {
char* curPos;
const static int BUF_SIZE = (200000);
char input[BUF_SIZE];
FILE * fin;
void init(FILE * _fin) {
fin = _fin;
fread(input, 1, sizeof(input), fin);
curPos = input;
}
Scanner() {;}
inline void ensureCapacity() {
int size = input + BUF_SIZE - curPos;
if (size < 100) {
memcpy(input, curPos, size);
fread(input + size, 1, BUF_SIZE - size, fin);
curPos = input;
}
}
inline int nextInt() {
ensureCapacity();
while (!isdigit(*curPos))
++curPos;
int res = 0;
while (*curPos >= '0' && *curPos <= '9')
res = res * 10 + (*(curPos++) & 15);
return res;
}
} Sc;
//CODE STARTS HERE
const string filein = "xormax.in";
const string fileout = "xormax.out";
#define MAX_LOG 21
#define MAX_N 100111
int N, trie[1<<(MAX_LOG + 1)], A[MAX_N], pref_xor[MAX_N], result;
inline void add_trie(int x, int at) {
int cur_node = 1;
fod (cur_bit, MAX_LOG - 1, 0) {
// mark this subtree as containing at least one value
trie[cur_node] = 1;
if (checkbit(x, cur_bit))
cur_node = 2 * cur_node + 1;
else
cur_node = 2 * cur_node;
}
trie[cur_node] = at;
debug("added:", at, "to:", cur_node);
}
inline int search_trie(int x) {
int cur_node = 1;
fod (cur_bit, MAX_LOG - 1, 0) {
if (checkbit(x, cur_bit)) {
// we wanna go left now for max_xor;
if (trie[2*cur_node])
cur_node = 2 * cur_node;
else
cur_node = 2 * cur_node + 1;
} else {
// we wanna go right now for max_xor;
if (trie[2*cur_node + 1])
cur_node = 2 * cur_node + 1;
else
cur_node = 2 * cur_node;
}
}
return trie[cur_node];
}
int main() {
FILE * fin = fopen(filein.c_str(), "r");
FILE * fout = fopen(fileout.c_str(), "w");
Sc.init(fin);
N = Sc.nextInt();
fo (i, 1, N)
A[i] = Sc.nextInt();
//pair<int, pair<int, int>> sol = mp(-1, mp(-1, -1));
pii ends;
result = -1;
add_trie(0, 0);
fo (i, 1, N) {
pref_xor[i] = pref_xor[i-1] ^ A[i];
debug("i:", i, "A[i]:", A[i], "pref_xor[i]:", pref_xor[i]);
int best_index = search_trie(pref_xor[i]);
int best_val = pref_xor[i] ^ (pref_xor[best_index]);
if (best_val > result) {
result = best_val;
ends = mp(best_index + 1, i);
}
add_trie(pref_xor[i], i);
}
debug(result, ends);
fprintf(fout, "%d %d %d", result, ends.fi, ends.se);
return 0;
}