#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
void setmin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void setmax(T& a, T val) {
  if (a < val) a = val;
}
void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n;
  cin >> n;
  long long a[n];
  for (int i = (0); i < (n); i++) cin >> a[i];
  pair<long long, long long> pp[n];
  for (int i = (0); i < (n); i++) {
    pp[i].first = a[i];
    pp[i].second = i;
  }
  sort(pp, pp + n);
  vector<vector<long long> > ans;
  int vis[n];
  memset(vis, 0, sizeof(vis));
  for (int i = (0); i < (n); i++) {
    if (vis[i] == 0) {
      vector<long long> temp;
      long long ptr = i;
      temp.push_back(ptr);
      vis[ptr] = 1;
      while (vis[pp[ptr].second] == 0) {
        temp.push_back(pp[ptr].second);
        vis[pp[ptr].second] = 1;
        ptr = pp[ptr].second;
      }
      ans.push_back(temp);
    }
  }
  cout << ans.size() << "\n";
  for (int i = (0); i < (ans.size()); i++) {
    cout << ans[i].size() << " ";
    for (int j = (0); j < (ans[i].size()); j++) {
      cout << ans[i][j] + 1 << " ";
    }
    cout << "\n";
  }
  return 0;
}
