class segtree:
  def __init__(self,n):
    self.size=1
    while self.size<n:
      self.size*=2
    self.dat=[-1]*(self.size*2)
  def update(self,x,a):
    x+=self.size
    self.dat[x]=a
    while x>1:
      x//=2
      self.dat[x]=max(self.dat[2*x],self.dat[2*x+1])
  def querry(self,u,v):
    u+=self.size
    v+=self.size
    score=-1
    while u<v:
      if u&1:
        score=max(score,self.dat[u])
        u+=1
      if v&1:
        v-=1
        score=max(score,self.dat[v])
      u//=2
      v//=2
    return score
N=int(input())
A=list(map(int,input().split()))
G=[[] for i in range(N+1)]
Z=segtree(N+1)
h=[]
dp=[0]*(N+1)
p=[[] for i in range(N+1)]
for x in range(1,N+1):
  y=A[x-1]
  z=Z.querry(0,y)
  if z<0:
    h.append(x)
    dp[x]=0
    Z.update(y,dp[x]*10**6+x)
  else:
    count=z//(10**6)
    pos=z%(10**6)
    dp[x]=count+1
    Z.update(y,dp[x]*10**6+x)
for i in range(1,N+1):
  count=dp[i]
  p[count].append(i)
for i in range(N):
  if len(p[i])==0:
    exit()
  ansx=10**10
  ansy=10**10
  for x in p[i]:
    ansx=min(ansx,x)
    ansy=min(ansy,A[x-1])
  print(ansx,ansy)