#include using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; #define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep2(i, a, b) rep3(i, a, b, 1) #define rep1(i, n) rep2(i, 0, n) #define rep0(n) rep1(aaaaa, n) #define ov4(a, b, c, d, name, ...) name #define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__) #define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--) #define fore(e, v) for (auto &&e : v) #define all(a) begin(a), end(a) #define sz(a) (int)(size(a)) #define lb(v, x) (lower_bound(all(v), x) - begin(v)) #define eb emplace_back template bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } const int INF = 1e9 + 100; const ll INFL = 3e18 + 100; #define i128 __int128_t struct _ { _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); } } __; template struct segtree { segtree(int n) : segtree(vector(n, e())) {} segtree(const vector &v) : n(sz(v)) { s = bit_ceil(unsigned(n)); log = countr_zero(unsigned(s)); d = vector(2 * s, e()); rep(i, n) d[s + i] = v[i]; per(i, s, 1) update(i); } // d655ce82 void set(int p, S x) { d[p += s] = x; rep(i, 1, log + 1) update(p >> i); } // 255c3505 S prod(int l, int r) const { S sml = e(), smr = e(); l += s, r += s; while (l < r) { if (l & 1) sml = op(sml, d[l++]); if (r & 1) smr = op(d[--r], smr); l >>= 1, r >>= 1; } return op(sml, smr); } // 6f0dc967 S all_prod() const { return d[1]; } S get(int p) const { return d[s + p]; } private: int n, s, log; vector d; void update(int k) { d[k] = op(d[k * 2], d[k * 2 + 1]); } }; pii seg_e(){ return pii{INF,-1}; } pii seg_op(pii a,pii b){ return min(a,b); } int main() { int N; cin>>N; segtree seg(N); rep(i,N){ int y; cin>>y; seg.set(i,pii{y,i}); } while(1){ int R=N; auto s=seg.prod(0,R); int y=s.first; R=s.second; // cerr<