#include <bits/stdc++.h>
#pragma GCC optimize("O3")
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return __builtin_popcount(s);
}
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
using namespace std;
const int MAXN = 1e5 + 100;
const int MOD = 1e9 + 7;
const double eps = 1e-12;
const long long INF = 1e16;
inline string toStr(long long x) {
  string tmp = "";
  do tmp = char(x % 10 + '0') + tmp;
  while (x /= 10);
  return tmp;
}
inline long long toInt(string s) {
  long long res = 0;
  for (auto x : s) res = res * 10 + x - '0';
  return res;
}
vector<int> a, b, ans[MAXN];
bool done[MAXN];
int n;
unordered_map<int, int> Rank, pos;
set<int> S;
int main() {
  scanf("%d", &n);
  a.resize(n), b.resize(n);
  for (int i = 0, _a = (n); i < _a; ++i) {
    scanf("%d", &a[i]);
    S.insert(a[i]);
    b[i] = a[i], pos[a[i]] = i;
  }
  int res = 0;
  sort(begin(a), end(a));
  for (int i = 0, _a = (n); i < _a; ++i) Rank[a[i]] = i;
  while (!S.empty()) {
    int x = *S.begin();
    if (done[pos[x]]) {
      S.erase(x);
      continue;
    }
    ++res;
    done[pos[x]] = true;
    ans[res].push_back(pos[x] + 1);
    while (!S.empty()) {
      S.erase(x);
      if (done[Rank[x]]) {
        break;
      }
      done[Rank[x]] = true;
      ans[res].push_back(pos[b[Rank[x]]] + 1);
      x = b[Rank[x]];
    }
  }
  printf("%d\n", res);
  for (int i = 0, _a = (res); i < _a; ++i) {
    printf("%d ", ans[i + 1].size());
    for (auto x : ans[i + 1]) printf("%d ", x);
    puts("");
  }
}
