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.lang.reflect.Array;
        import java.util.Scanner;
        import java.io.*;
        import java.util.*;
        import java.math.*;
        import java.lang.*;
        import static java.lang.Math.*;
        public class main implements Runnable {

            static ArrayList<Integer> adj[];

            static void Check2(int n) {
                adj = new ArrayList[n + 1];
                for (int i = 0; i <= n; i++) {
                    adj[i] = new ArrayList<>();
                }

            }
            static void add(int i, int j) {
                adj[i].add(j);
                adj[j].add(i);
            }


            public static void main(String[] args) {
                new Thread(null, new main(), "Check2", 1 << 26).start();// to increse stack size in java
            }
            static long mod = (long) (1e9 + 7);
            public void run() {
                InputReader in = new InputReader(System.in);
                PrintWriter w = new PrintWriter(System.out);

                int n=in.nextInt();
                long a[]=new long[n+1];
                Long b[]=new Long[n+1];
                b[0]=(Long)Long.MIN_VALUE;
                HashMap <Long,Integer> map=new HashMap<>();
                for(int i=1;i<=n;i++){
                    a[i]=in.nextLong();
                    b[i]=a[i];
                    map.put(a[i],i);
                }
                Arrays.sort(b);

                Check2(n);

                for(int i=1;i<=n;i++){
                    if(a[i]!=b[i]){
                        adj[i].add(map.get(b[i]));
                        adj[map.get(b[i])].add(i);
                    }
                }
                int v[]=new int[n+1];
                list=new ArrayList<>();
                ArrayList <Integer> ans[]=new ArrayList[n+1];
                int co=0;
                for(int i=0;i<=n;i++)ans[i]=new ArrayList<>();
                for(int i=1;i<=n;i++){
                    if(v[i]==0){
                        list.clear();
                        dfs(i,v,w);
                        ans[co].addAll(list);
                        co++;

                    }
                }
                w.println(co);

                for(int i=0;i<co;i++){
                    list=ans[i];

                    w.print(list.size()+" ");
                    for(int j=0;j<list.size();j++){
                        w.print(list.get(j)+" ");
                    }
                    w.println();


                }










                w.close();
            }
            static ArrayList <Integer> list;
            static void dfs(int i,int v[],PrintWriter w){
                if(v[i]==1)return;
                v[i]=1;
                list.add(i);

                for(Integer ne:adj[i]){
                    dfs(ne,v,w);
                }

            }
            static class cmp implements Comparator<pair>{

                public int compare(pair o1,pair o2){
                    return o1.dist-o2.dist;
                }

            }
            static class pair {
                int val,dist;
                pair(int a,int b){
                    val=a;
                    dist=b;
                }

            }

            static long modinv(long a,long b)
            {
                long p=power(b,mod-2);

                p=a%mod*p%mod;
                p%=mod;

                return p;

            }

            static long power(long x,long y){
                if(y==0)return 1%mod;
                if(y==1)return x%mod;


                long res=1;
                x=x%mod;
                while(y>0){


                    if((y%2)!=0){
                        res=(res*x)%mod;
                    }


                    y=y/2;
                    x=(x*x)%mod;
                }


                return res;

            }
            static  int gcd(int a,int b){

                if(b==0)return a;
                return gcd(b,a%b);
            }

            static  void sev(int a[],int n){

                for(int i=2;i<=n;i++)a[i]=i;
                for(int i=2;i<=n;i++){

                    if(a[i]!=0){
                        for(int j=2*i;j<=n;){

                            a[j]=0;
                            j=j+i;
                        }
                    }

                }

            }



            static class node{

                int y;
                int val;

                node(int a,int b){

                    y=a;
                    val=b;

                }


            }

            static class InputReader
            {
                private InputStream stream;
                private byte[] buf = new byte[1024];
                private int curChar;
                private int numChars;
                private SpaceCharFilter filter;

                public InputReader(InputStream stream)
                {
                    this.stream = stream;
                }

                public int read()
                {
                    if (numChars==-1)
                        throw new InputMismatchException();

                    if (curChar >= numChars)
                    {
                        curChar = 0;
                        try
                        {
                            numChars = stream.read(buf);
                        }
                        catch (IOException e)
                        {
                            throw new InputMismatchException();
                        }

                        if(numChars <= 0)
                            return -1;
                    }
                    return buf[curChar++];
                }

                public String nextLine()
                {
                    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                    String str = "";
                    try
                    {
                        str = br.readLine();
                    }
                    catch (IOException e)
                    {
                        e.printStackTrace();
                    }
                    return str;
                }
                public int nextInt()
                {
                    int c = read();

                    while(isSpaceChar(c))
                        c = read();

                    int sgn = 1;

                    if (c == '-')
                    {
                        sgn = -1;
                        c = read();
                    }

                    int res = 0;
                    do
                    {
                        if(c<'0'||c>'9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    while (!isSpaceChar(c));

                    return res * sgn;
                }

                public long nextLong()
                {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    int sgn = 1;
                    if (c == '-')
                    {
                        sgn = -1;
                        c = read();
                    }
                    long res = 0;

                    do
                    {
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    while (!isSpaceChar(c));
                    return res * sgn;
                }

                public double nextDouble()
                {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    int sgn = 1;
                    if (c == '-')
                    {
                        sgn = -1;
                        c = read();
                    }
                    double res = 0;
                    while (!isSpaceChar(c) && c != '.')
                    {
                        if (c == 'e' || c == 'E')
                            return res * Math.pow(10, nextInt());
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    if (c == '.')
                    {
                        c = read();
                        double m = 1;
                        while (!isSpaceChar(c))
                        {
                            if (c == 'e' || c == 'E')
                                return res * Math.pow(10, nextInt());
                            if (c < '0' || c > '9')
                                throw new InputMismatchException();
                            m /= 10;
                            res += (c - '0') * m;
                            c = read();
                        }
                    }
                    return res * sgn;
                }

                public String readString()
                {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    StringBuilder res = new StringBuilder();
                    do
                    {
                        res.appendCodePoint(c);
                        c = read();
                    }
                    while (!isSpaceChar(c));

                    return res.toString();
                }

                public boolean isSpaceChar(int c)
                {
                    if (filter != null)
                        return filter.isSpaceChar(c);
                    return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
                }

                public String next()
                {
                    return readString();
                }

                public interface SpaceCharFilter
                {
                    public boolean isSpaceChar(int ch);
                }
            }







        }