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



int main() {


    ll n;
    cin >> n;
    vector<ll> seq(n);
    for (int i = 0; i < n; i++) cin >> seq[i];

    vector<bool> used(n, false);
    vector<vector<ll>> circles;
    ll k;
    for (int i = 0; i < n; i++) {
        if (used[i]) continue;
        if (seq[i] == i) continue;
        circles.push_back({i});
        k = seq[i];
        while (k != i) {
            used[k] = true;
            circles.back().push_back(k);
            k = seq[k];
        }
    }
    for (auto &c: circles) {
        sort(c.begin(), c.end());
        for (int i = 0; i < c.size() - 1; i++) {
            if (seq[c[i]] < seq[c[i+1]]) {
                cout << "NO" << endl;
                return 0;
            }
        }
    }
    cout << "YES" << endl;

    vector<pair<ll, ll>> ps;
    for (auto &c: circles) {
        ps.push_back({c[0], c[1]});
    }

    sort(ps.begin(), ps.end());
    vector<vector<ll>> sets;
    set<pair<ll, ll>> u;
    for (auto [a, b]: ps) {
        if (u.empty() || (*(--u.end())).first < b) {
            u.insert({b, sets.size()});
            sets.push_back({a, b});
        } else {
            pair<ll, ll> it = *u.lower_bound({b, -1});
            u.erase(it);
            u.insert({b, it.second});
            sets[it.second].push_back(a);
            sets[it.second].push_back(b);
        }
    }
    cout << u.size() << endl;
    for (auto &s: sets) {
        sort(s.begin(), s.end());
        cout << s.size() << " ";
        for (auto a: s) cout << a << " ";
        cout << endl;
    }



    return 0;
}