#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
const int mx = 1e5 + 5;
int par[mx];
vector<int> v[mx];
set<int> s;
int Find(int a) {
  if (par[a] == a) return a;
  par[a] = Find(par[a]);
  return par[a];
}
void Union(int a, int b) {
  int u = Find(a);
  int v = Find(b);
  if (u != v) par[u] = v;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) par[i] = i;
  long long a[n], b[n];
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b, b + n);
  for (int i = 0; i < n; ++i) {
    int lo = 0, hi = n - 1, mid;
    while (lo <= hi) {
      mid = (lo + hi) / 2;
      if (a[i] == b[mid])
        break;
      else if (a[i] > b[mid])
        lo = mid + 1;
      else
        hi = mid - 1;
    }
    Union(i, mid);
  }
  for (int i = 0; i < n; ++i) {
    int temp = Find(i);
    v[temp].push_back(i);
    s.insert(temp);
  }
  cout << s.size() << '\n';
  for (set<int>::iterator itr = s.begin(); itr != s.end(); ++itr) {
    int temp = *itr;
    int l = v[temp].size();
    cout << l << " ";
    for (int i = 0; i < l; ++i) {
      cout << v[temp][i] + 1 << " ";
    }
    cout << '\n';
  }
}
