#include <bits/stdc++.h>
using namespace std;

#include <atcoder/fenwicktree>
using namespace atcoder;

int N;
vector<int> P, Q, T;
bool isok(int i)
{
  return (Q.at(i) % 2 == T.at(i) % 2);
}

clock_t start_time;
int cnt = 0;
void dfs(int i, int last)
{
  if (clock() - start_time >= 1900000)
  {
    cout << "No" << endl;
    exit(0);
  }

  if (i == 0)
  {
    if (isok(i))
    {
      vector<int> X(N), Y(N);
      for (int i = 0; i < N; i++)
      {
        X.at(i) = P.at(Q.at(i));
        Y.at(i) = Q.at(i) - T.at(i);
      }
      reverse(X.begin(), X.end());
      reverse(Y.begin(), Y.end());

      cout << "Yes" << endl;
      for (int i = 0; i < N; i++)
      {
        cout << X.at(i) + 1 << " " << Y.at(i) + 1 << endl;
      }
      exit(0);
    }
    return;
  }

  int rnd = 1 - last;

  if (rnd == 0)
  {
    if (isok(i))
      dfs(i - 1, rnd);
  }

  swap(Q.at(i - 1), Q.at(i));
  swap(T.at(i - 1), T.at(i));
  if (Q.at(i - 1) < Q.at(i))
    T.at(i)++;
  else
    T.at(i - 1)--;
  if (isok(i))
    dfs(i - 1, rnd);
  swap(Q.at(i - 1), Q.at(i));
  swap(T.at(i - 1), T.at(i));
  if (Q.at(i - 1) < Q.at(i))
    T.at(i)++;
  else
    T.at(i - 1)--;
  
  if (rnd == 1)
  {
    if (isok(i))
      dfs(i - 1, rnd);
  }
}

int main()
{
  srand((unsigned)time(NULL));
  start_time = clock();
  cin >> N;
  P.resize(N);
  for (int i = 0; i < N; i++)
  {
    cin >> P.at(i);
    P.at(i)--;
  }

  Q.resize(N);
  for (int i = 0; i < N; i++)
  {
    Q.at(P.at(i)) = i;
  }
  reverse(Q.begin(), Q.end());

  fenwick_tree<int> fw(N);
  T.resize(N);
  for (int i = 0; i < N; i++)
  {
    T.at(i) = fw.sum(0, Q.at(i));
    fw.add(Q.at(i), 1);
  }

  dfs(N - 1, 0);
  cout << "No" << endl;
}