# ACL-for-python by shakayami
# https://github.com/shakayami/ACL-for-python

class fenwick_tree():
    n = 1
    data = [0 for i in range(n)]

    def __init__(self, N):
        self.n = N
        self.data = [0 for i in range(N)]

    def add(self, p, x):
        assert 0 <= p < self.n, "0<=p<n,p={0},n={1}".format(p, self.n)
        p += 1
        while(p <= self.n):
            self.data[p-1] += x
            p += p & -p

    def sum(self, l, r):
        assert (0 <= l and l <= r and r <=
                self.n), "0<=l<=r<=n,l={0},r={1},n={2}".format(l, r, self.n)
        return self.sum0(r)-self.sum0(l)

    def sum0(self, r):
        s = 0
        while(r > 0):
            s += self.data[r-1]
            r -= r & -r
        return s

import sys

n = int(input())
p = list(map(int, input().split()))
for i in range(n):
  p[i] -= 1
q = [0] * n
for i in range(n):
  q[p[i]] = i

fw = fenwick_tree(n)
x, y = [0] * n, [0] * n
for i in range(n - 1):
  y1 = fw.sum(0, q[i])
  y2 = fw.sum(0, q[i + 1])
  if y1 % 2 != 0 and y2 % 2 != 0:
    print("No")
    sys.exit(0)
  if y2 % 2 == 0:
    if y1 % 2 != 0 or q[i] < q[i + 1]:
      q[i], q[i + 1] = q[i + 1], q[i]
      y1, y2 = y2, y1
  x[i] = p[q[i]]
  y[i] = y1
  fw.add(q[i], 1)
x[-1] = p[q[-1]]
y[-1] = fw.sum(0, q[-1])
if y[-1] % 2 != 0:
  print("No")
  sys.exit(0)

print("Yes")
for i in range(n):
  print(x[i] + 1, y[i] + 1)