// auxiliary functionsintfa(intx){...}voiddfs(intcur,intfa,intdepth){...}autoargmax(unordered_map<int,int>&mp){...}// solvervoidsolve(vector<int>&v){build_tree();dfs_twice_for_diameter();discussion_and_output();}

includeusingnamespacestd;constintINF=0x3f3f3f3f;define ALL(x) begin(x), end(x)define SZ(x) (int)(x).size()unordered_map<int,set<int>>G;// for build treeintfa(intx){inti=0;while(x>(1<<i))i++;return(1<<i)-x;}// for diameterunordered_map<int,int>depths;voiddfs(intcur,intfa,intdepth){depths[cur]=depth;for(intnxt:G[cur])if(nxt!=fa)dfs(nxt,cur,depth+1);}autoargmax(unordered_map<int,int>&mp){pair<int,int>P=make_pair(-1,-INF);for(autoit:mp)if(it.second>P.second)P=it;returnP;}// solver ==================voidsolve(vector<int>&v){// build treefor(intit:v){while(it!=0){intfa_it=fa(it);G[fa_it].insert(it);G[it].insert(fa_it);it=fa_it;}}// twice DFS to calc diameter PQdfs(0,-1,0);autoP=argmax(depths);dfs(P.first,-1,0);autoQ=argmax(depths);// discussion, print answerif(Q.first!=0){printf("%d %d %d",find(ALL(v),P.first)-v.begin()+1,find(ALL(v),Q.first)-v.begin()+1,Q.second);}else{// degenerate: tree is mono-chainpair<int,int>mx=make_pair(-1,-INF),mn=make_pair(-1,INF);for(inti=0;i<SZ(v);i++){if(v[i]>mx.second)mx=make_pair(i,v[i]);if(v[i]<mn.second)mn=make_pair(i,v[i]);}printf("%d %d %d",mn.first+1,mx.first+1,depths[mn.second]);}}intmain(){intn;cin>>n;vector<int>v(n,-1);for(inti=0;i<n;i++)cin>>v[i];solve(v);return0;}