#!/usr/bin/env python3
n = int(input())
points = [3*n] + [int(i) for i in input().split()]

x, y = 1,1
for i in range(n):
    bestp = (0,0)
    bestv = 2*n+1
    for i,j in enumerate(points):
        newv = abs(x-i) + abs(y-j)
        if newv < bestv:
            bestv = newv
            bestp = (i,j)
    print(*bestp)
    x,y = bestp
    points[x] = 3*n