Problem: You are given a sequence a1, a2, ..., an consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting integers in each of them in increasing order, the total sequence also will be sorted in increasing order.

Sorting integers in a subsequence is a process such that the numbers included in a subsequence are ordered in increasing order, and the numbers which are not included in a subsequence don't change their places.

Every element of the sequence must appear in exactly one subsequence.

Input

The first line of input data contains integer n (1 ≤ n ≤ 105) — the length of the sequence.

The second line of input data contains n different integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — the elements of the sequence. It is guaranteed that all elements of the sequence are distinct.

Output

In the first line print the maximum number of subsequences k, which the original sequence can be split into while fulfilling the requirements.

In the next k lines print the description of subsequences in the following format: the number of elements in subsequence ci (0 < ci ≤ n), then ci integers l1, l2, ..., lci (1 ≤ lj ≤ n) — indices of these elements in the original sequence. 

Indices could be printed in any order. Every index from 1 to n must appear in output exactly once.

If there are several possible answers, print any of them.

Examples

Input

6
3 2 1 6 5 4


Output

4
2 1 3
1 2
2 4 6
1 5


Input

6
83 -75 -49 11 37 62


Output

1
6 1 2 3 4 5 6

Note

In the first sample output:

After sorting the first subsequence we will get sequence 1 2 3 6 5 4.

Sorting the second subsequence changes nothing.

After sorting the third subsequence we will get sequence 1 2 3 4 5 6.

Sorting the last subsequence changes nothing.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class SortingbySubsequences {
      static  class osama implements Comparable<osama>{
        int v ,i;

        public osama(int v, int i) {
            this.v = v;
            this.i = i;
        }

        @Override
        public int compareTo(osama t) {
               return (this.v==t.v)?this.i-t.i:this.v-t.v ;
        }


}
    static class graph {

        ArrayList<Integer>[] adj;

        public graph(int n) {
          marked = new boolean[n];
            adj = new ArrayList[n];
            for (int i = 0; i < n; i++) {
                adj[i] = new ArrayList<>();
            }
        }

        public void addedge(int n1, int n2) {
            adj[n1].add(n2);
            adj[n2].add(n1);

        }

    }
    
    static boolean[] marked;
    
    
    
    static int numofcomb(graph g){
        int c =0;
        for (int i = 1; i < g.adj.length; i++) {
            if (!marked[i]) {
                c++;
                dfs(i,g);
            }
        }
        return c;
    }
    
    
    
    static void dfs(int n1, graph s){
        marked[n1] = true;
        for (int w : s.adj[n1]) {
            if (!marked[w]){
                dfs(w, s);
            }
        }
    }
static void dfs2(int n1, graph s){
        mark[n1] = true;
        re.add(n1);
        for (int w : s.adj[n1]) {
            if (!mark[w]){
                dfs2(w, s);
            }
        }
    }
   static  List<Integer> re;
   static  boolean[] mark;
   static  void solve(graph g, int n, int d ) {
          mark= new boolean[n];
         for (int i = 1; i <n ; i++){
             if (!mark[i]){
             re= new ArrayList<>();
                 StringBuilder os = new StringBuilder();
                 dfs2(i,g);
                 os.append(re.size()+" ");
                 for (int l = 0; l <re.size(); l++) {
                     if (l+1==re.size()) {
                          os.append(re.get(l)+"\n");
                     }else os.append(re.get(l)+" ");
                 }
                 System.out.print(os);  
             }
             
             
         }
    }
   
     
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        TreeSet<osama>tree= new TreeSet<>();
        int n = in.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];
        graph g = new graph(n+1);
        for (int i = 0; i < n; i++) {
            x[i]=in.nextInt();
            y[i]=x[i];
        }
        Arrays.sort(y);
        for (int i = 0; i < n; i++) {
            tree.add(new osama(y[i],i));
        }
        for (int i = 0; i < n; i++) {
            osama temp = tree.ceiling(new osama(x[i],0));
            if (temp!=null&&temp.v==x[i]) {
                g.addedge(i+1, temp.i+1);
                tree.remove(temp);
            }
        }
        int ss =numofcomb(g);
        System.out.println(ss);
        solve(g,n+1,ss);
    }
}