#!/usr/bin/env python3
n = int(input())
points = set([(i+1,int(c)) for i,c in enumerate(input().split())])

x, y = 1,1
result = []
while len(points) > 0:
    bestp = (0,0)
    bestv = 2*n
    for i,j in points:
        newv = abs(x-i) + abs(y-j)
        if newv < bestv:
            bestv = newv
            bestp = (i,j)
    result.append("%i %i" % bestp)
    x,y = bestp
    points.remove(bestp)
print(*result, sep='\n')