#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
inline void gn(int &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
inline void gn(long long &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
inline void gn(double &first) { scanf("%lf", &first); }
inline void newline() { putchar('\n'); }
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int a[100010];
int arr[100010];
int pos[100010], vst[100010], vis[100010];
vector<int> adj[100010];
int main() {
  int N;
  cin >> N;
  for (int i = 0; i < N; i++) {
    gn(a[i]);
    arr[i] = a[i];
  }
  sort(arr, arr + N);
  for (int i = 0; i < N; i++) {
    int k = lower_bound(arr, arr + N, a[i]) - arr;
    pos[k] = i;
  }
  int cnt = 0;
  for (int i = 0; i < N; i++) {
    int u = i;
    if (pos[u] == i) {
      adj[cnt++].push_back(u);
      continue;
    }
    int n = 0;
    while (true) {
      if (vis[u]) break;
      n++;
      adj[cnt].push_back(pos[u]);
      vis[u] = 1;
      u = lower_bound(arr, arr + N, a[u]) - arr;
    }
    if (n) cnt++;
  }
  cout << cnt << endl;
  for (int i = 0; i < cnt; i++) {
    printf("%d ", adj[i].size());
    for (int j = 0; j < adj[i].size(); j++) printf("%d ", adj[i][j] + 1);
    cout << endl;
  }
  return 0;
}
