#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int nx8[] = {1, 1, -1, -1, 2, 2, -2, -2};
int ny8[] = {2, -2, 2, -2, 1, -1, 1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, a[100005], b[100005], c, com;
vector<int> v[100005];
map<int, int> m;
bool bl[100005];
void dfs(int p) {
  if (bl[p]) return;
  bl[p] = true;
  v[com].push_back(p);
  dfs(b[p]);
}
int main() {
  scanf("%d", &n);
  for (__typeof(n) i = (1); i <= (n); i++) scanf("%d", &a[i]);
  for (__typeof(n) i = (1); i <= (n); i++) b[i] = a[i];
  sort(b + 1, b + n + 1);
  for (__typeof(n) i = (1); i <= (n); i++) m[b[i]] = ++c;
  for (__typeof(n) i = (1); i <= (n); i++) b[i] = m[a[i]];
  for (int i = 1; i <= n; i++) {
    if (bl[i] == false) {
      ++com;
      dfs(i);
    }
  }
  cout << com, printf("\n");
  for (__typeof(com) i = (1); i <= (com); i++) {
    printf("%d", (int)v[i].size());
    for (int j = 0; j < (int)v[i].size(); j++) printf(" %d", v[i][j]);
    printf("\n");
  }
  return 0;
}
