#include using namespace std; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args&&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; using u8 = uint8_t; using u32 = uint32_t; using u64 = uint64_t; using vi = vector; using vl = vector; using pii = pair; using pll = pair; template > using prique = std::priority_queue, U>; inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcountll(x); } template T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) noexcept { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } template void dedup(std::vector& v) { std::sort(std::begin(v), std::end(v)), v.erase(std::unique(std::begin(v), std::end(v)), std::end(v)); } void SCAN() {} template void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); } #define INT(...) int __VA_ARGS__; SCAN(__VA_ARGS__) #define LL(...) long long __VA_ARGS__; SCAN(__VA_ARGS__) #define LD(...) long double __VA_ARGS__; SCAN(__VA_ARGS__) #define STR(...) std::string __VA_ARGS__; SCAN(__VA_ARGS__) #define CHAR(...) char __VA_ARGS__; SCAN(__VA_ARGS__) #define VEC(type, name, size) std::vector name(size); for (int i = 0; i < (int)size; i++) SCAN(name[i]); #define VV(type, name, h, w) std::vector> name(h, std::vector(w)); for (int i = 0; i < (int)h; i++) for (int j = 0; j < (int)w; j++) SCAN(name[i][j]); #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define len(x) (long long)(size(x)) #define pb push_back #ifndef LOCAL #define debug(...) #endif #include #include using mint = atcoder::modint; int op(int a, int b) { return min(a, b); } int e() { return 1e9; } void run_case() { INT(N); VEC(int, P, N); rep(i, N) P[i]--; atcoder::segtree seg(P); int c = N; while (c) { vi xs; int prod = e(); auto f = [&](int x) -> bool { return x >= prod; }; int it = 0; while (it < N) { int r = seg.max_right(it, f); if (r < N) { xs.push_back(r); prod = P[r]; } it = r; } int xx = 1e9, yy = 1e9; for (int x : xs) { chmin(xx, x + 1); chmin(yy, P[x] + 1); seg.set(x, e()); c--; } cout << xx << " " << yy << "\n"; } } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; while (T--) run_case(); return 0; }