## https://yukicoder.me/problems/no/3238



class SegmentTree:
    """
    非再帰版セグメント木。
    更新は「加法」、取得は「最大値」のもの限定。
    """

    def __init__(self, init_array):
        n = 1
        while n < len(init_array):
            n *= 2
        
        self.size = n
        self.array = [0] * (2 * self.size)
        for i, a in enumerate(init_array):
            self.array[self.size + i] = a
        
        end_index = self.size
        start_index = end_index // 2
        while start_index >= 1:
            for i in range(start_index, end_index):
                self.array[i] = max(self.array[2 * i], self.array[2 * i + 1])
            end_index = start_index
            start_index = end_index // 2

    def set(self, x, a):
        index = self.size + x
        self.array[index] = a
        while index > 1:
            index //= 2
            self.array[index] = max(self.array[2 * index], self.array[2 * index + 1])

    def get_max(self, l, r):
        L = self.size + l; R = self.size + r

        # 2. 区間[l, r)の最大値を求める
        s = 0
        while L < R:
            if R & 1:
                R -= 1
                s = max(s, self.array[R])
            if L & 1:
                s = max(s, self.array[L])
                L += 1
            L >>= 1; R >>= 1
        return s



def main():
    N = int(input())
    P = list(map(int, input().split()))

    p_list = [(i, p) for i, p in enumerate(P)]
    p_list.sort(key=lambda x :x[1])

    seg_tree = SegmentTree([0] * N)

    array = [[] for _ in range(N + 1)]
    for i, p in p_list:
        x = seg_tree.get_max(0, i)
        x += 1
        array[x].append((i, p))

        seg_tree.set(i, x)

    for x in range(N + 1):
        if len(array[x]) == 0:
            continue

        ar = array[x]
        x_min = float("inf")
        y_min = float("inf")
        for i, p in ar:
            x_min = min(x_min, i)
            y_min = min(y_min, p)

        print(x_min + 1, y_min)














if __name__ == "__main__":
    main()