import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bChmax(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bChmax: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    chmax(bit[x], val);
  }
}

// max of [0, pos)
T bMax(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bMax: 0 <= pos <= |bit| must hold");
}
do {
  T ret = T.min;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    chmax(ret, bit[x]);
  }
  return ret;
}



void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto P = new int[N];
      foreach (i; 0 .. N) P[i] = readInt - 1;
      
      auto bit = new int[N];
      bit[] = -1;
      auto dp = new int[N];
      foreach (i; 0 .. N) {
        dp[i] = max(1 + bit.bMax(P[i]), 0);
        bit.bChmax(P[i], dp[i]);
      }
      debug writeln(dp);
      
      const M = dp.maxElement + 1;
      auto xs = new int[M];
      auto ys = new int[M];
      xs[] = N;
      ys[] = N;
      foreach (i; 0 .. N) {
        chmin(xs[dp[i]], i);
        chmin(ys[dp[i]], P[i]);
      }
      
      foreach (m; 0 .. M) {
        writeln(xs[m] + 1, " ", ys[m] + 1);
      }
    }
  } catch (EOFException e) {
  }
}