#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:66777216")
const int mox[8] = {1, 0, 0, -1, 1, -1, 1, -1};
const int moy[8] = {0, -1, 1, 0, -1, -1, 1, 1};
const char mover[4] = {'D', 'L', 'R', 'U'};
const long long INF = (1LL << 61);
const int inf = (int)2e9;
const long double PI = acos(-1.0);
const long double EPS = 1e-9;
bool debug;
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
void solve();
int main() {
  debug = 0;
  cout.precision(30);
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  srand((unsigned)time(NULL));
  solve();
  if (debug)
    cout << '\n'
         << '\n'
         << "time: " << clock() * 1.0 / CLOCKS_PER_SEC * 1000 << " ms" << '\n';
}
const int N = 100005;
const int MAGIC = (int)sqrt((double)N + .0);
const int lg = 26;
map<int, int> di;
int a[N], n;
int dsu[N];
bool u[N];
vector<vector<int>> ans;
void dfs(int val, int pos) {
  u[pos] = true;
  int to = di[val];
  if (!u[to]) dfs(a[to], to);
  ans.back().push_back(di[val]);
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    di[a[i]] = i;
  }
  sort(a, a + n);
  for (int i = 0; i < n; i++)
    if (!u[i]) {
      ans.push_back(vector<int>());
      dfs(a[i], i);
    }
  cout << (int)ans.size() << '\n';
  for (int i = 0; i < (int)ans.size(); i++) {
    cout << (int)ans[i].size() << " ";
    for (int j = 0; j < (int)ans[i].size(); j++) cout << ans[i][j] + 1 << " ";
    cout << '\n';
  }
}
