#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 17;
const int MAXM = 20;
const int INF = 0x7fffffff;
const int MOD = 1e9 + 7;
int a[MAXN], b[MAXN], vis[MAXN];
map<int, int> mp;
vector<int> ans[MAXN];
void dfs(int plc, vector<int>& v) {
  v.push_back(plc);
  vis[plc] = 1;
  if (!vis[mp[a[plc]]]) dfs(mp[a[plc]], v);
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b + 1, b + n + 1);
  for (int i = 1; i <= n; ++i) {
    mp[b[i]] = i;
  }
  int x = 0;
  for (int i = 1; i <= n; ++i) {
    if (!vis[i]) {
      dfs(i, ans[x++]);
    }
  }
  cout << x << endl;
  for (int i = 0; i < x; ++i) {
    printf("%d ", ans[i].size());
    for (int j = 0; j < ans[i].size(); ++j) {
      printf("%d%c", ans[i][j], j == ans[i].size() - 1 ? '\n' : ' ');
    }
  }
  return 0;
}
