#include <bits/stdc++.h>
#define ls (o<<1)
#define rs (o<<1|1)
#define mid (l+r>>1)
using namespace std;
const int N = 2e5+100;
int tree[4*N];
void build(int o,int l,int r) {
if(l==r) cin>>tree[o];
build(ls,l,mid);
build(rs,mid+1,r);
tree[o] = max(tree[ls],tree[rs]);
}
int get(int o, int l, int r, int x) {
if (l == r) return l;
return tree[ls] > x ? get(ls, l, mid, x) : get(rs, mid+1, r, x);
}
int query(int o, int l, int r, int ql, int qr, int x) { //查询[ql,qr]内第一个大于x的数的位置
if (qr < l || r < ql) return -1;
if (ql <= l && r <= qr) return tree[o] > x ? get(o, l, r, x) : -1;
int t = query(ls, l, mid, ql, qr, x);
return t != -1 ? t : query(rs, mid+1, r, ql, qr, x);
}