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

using T = atcoder::fenwick_tree<int>;

int main()
{
    int N;
    cin >> N;
    vector<int> P(N), inv(N);
    vector<int> C(N);
    for (int i = 0; i < N; ++i)
        cin >> P[i], --P[i];
    for (int i = 0; i < N; ++i)
        inv[P[i]] = i;
    T t(N);
    for (int i = 0; i < N; ++i)
    {
        C[i] = t.sum(0, P[i]);
        t.add(P[i], 1);
    }
    int pre = N; // popped until pre
    int le = N - 1, ge = 0;
    vector<pair<int, int>> arr;
    for (int p = N - 1; p >= 0; --p)
    {
        if (ge <= inv[p] && inv[p] <= le && C[inv[p]] % 2 == 0)
        {
            arr.emplace_back(p, C[inv[p]]);
            for (int x = pre - 1; x > p; --x)
                arr.emplace_back(x, C[inv[x]] - C[inv[x]] % 2);
            pre = p;
            le = N - 1;
            ge = 0;
        }
        else
        {
            if (C[inv[p]] % 2 == 0)
                ge = max(ge, inv[p]);
            else
                le = min(le, inv[p]);
        }
    }
    if (pre != 0)
    {
        cout << "No" << endl;
    }
    else
    {
        reverse(arr.begin(), arr.end());
        cout << "Yes" << endl;
        for (auto [a, b] : arr)
            cout << a + 1 << " " << b + 1 << endl;
    }
}