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.io.BufferedWriter;
    import java.io.IOException;
    import java.io.InputStream;
    import java.io.OutputStream;
    import java.io.OutputStreamWriter;
    import java.io.PrintWriter;
    import java.io.Writer;
    import java.util.Arrays;
    import java.util.InputMismatchException;
    import java.util.*;
    import java.io.*;
    import java.math.*;
	public class Main{

    static class Pair
        { 
            int x; 
            int y;
            public Pair(int x, int y) 
            {     
                this.x = x; 
                this.y = y; 
            }     
        } 
        static class Compare
        { 
            static void compare(Pair arr[], int n) 
            { 
                // Comparator to sort the pair according to second element 
                Arrays.sort(arr, new Comparator<Pair>() { 
                    @Override public int compare(Pair p1, Pair p2) 
                    { 
                        return p1.x - p2.x; 
                    } 
                }); 
            } 
        }
        public static long pow(long a, long b)
        {
            long result=1;
            while(b>0)
            {
                if (b % 2 != 0)
                {
                    result=(result*a)%(mod);
                    b--;
                } 
                a=(a*a)%(mod);
                b /= 2;
            }   
            return result;
        }
        public static long fact(long num)
        {
                    long value=1;
                    int i=0;
                    for(i=2;i<num;i++)
                    {
                        value=((value%mod)*i%mod)%mod;
                    }
                    return value;
                }
                public static long gcd(long a, long b)
                {
                    if (a == 0)
                        return b;
                    return gcd(b%a, a);
                }
                
                public static long lcm(int a,int b)
                {
                    return a * (b / gcd(a, b));
                }
                public static long sum(int h)
                {
                    return (h*(h+1)/2);
                }
                public static void dfs(int parent,boolean[] visited)
                {
                    ArrayList<Integer> arr=new ArrayList<Integer>();
                    arr=graph.get(parent);
                    visited[parent]=true;
					ar.add(parent);
					count++;
                    for(int i=0;i<arr.size();i++)
                    {
                        int num=arr.get(i);
                        if(visited[num]==false)
                        {
                            dfs(num,visited);
                        }
                    }
                }
            //    static int[] count;
				static int count=0;
                static int f=0;
                static char[] ch;
                static long mod=1000000007L;
                static ArrayList<ArrayList<Integer>> graph;
				static ArrayList<Integer> ar=new ArrayList<>();

                public static void bfs(int root, boolean[] visited)
                {
                Queue<Integer> q=new LinkedList<>();
                q.add(root);
                visited[root]=true;
                dis[root]=0;
                while(!q.isEmpty())
                {
                    int x=q.poll();
                    ArrayList<Integer> al=graph.get(x);
                    for(int i=0;i<al.size();i++)
                    {
                        int y=al.get(i);    
                        if(visited[y]==false)
                        {
                            q.add(y);
                            dis[y]=dis[x]+1;//Math.min(dis[x]+1,dis[y]);
                            visited[y]=true;
                        }
                    }
                }
                }
                static int[] dis;
				static int[] dis1;
                public static void main(String args[])throws IOException
                {
                    InputReader in=new InputReader(System.in);
                    OutputWriter out=new OutputWriter(System.out);
                //    long a=pow(26,1000000005);
                //    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                    ArrayList<Integer> ar4=new ArrayList<>();
                    TreeSet<Integer> ts=new TreeSet<>();
                    TreeSet<Integer> ts1=new TreeSet<>();
                    TreeSet<String> pre=new TreeSet<>();
            //      ArrayList<Integer> ar=new ArrayList<>();
                    ArrayList<Integer> ar1=new ArrayList<>();
                      
                    HashMap<Integer,Integer> hash=new HashMap<Integer,Integer>();
                    HashMap<Long,Integer> hash2=new HashMap<Long,Integer>();
				/*	boolean[] prime=new boolean[10001];
                    for(int i=2;i*i<=10000;i++)
                    {
                        if(prime[i]==false)
                        {
                            for(int j=2*i;j<=10000;j+=i)
                            {
                                prime[j]=true;
                                
                            }
                        }
                    }*/
					int n=i();
					int[] a=new int[n];
					int[] b=new int[n];
					for(int i=0;i<n;i++)
					{
						a[i]=i();
						hash.put(a[i],i);
						b[i]=a[i];
					}
					graph=new ArrayList<>();
					for(int i=0;i<n;i++)
					{
						graph.add(new ArrayList<>());
					}
					Arrays.sort(b);
					int ans=0,ans1=0;
					for(int i=0;i<n;i++)
					{
						if(a[i]==b[i])
						{
							ans1++;
						}
					}
					for(int i=0;i<n;i++)
					{
						if(a[i]!=b[i])
						{
							graph.get(i).add(hash.get(b[i]));
							graph.get(hash.get(b[i])).add(i);
							ar1.add(i);
						}
					}
					boolean[] visited=new boolean[n];
					ArrayList<Integer> size=new ArrayList<Integer>();
					for(int i=0;i<ar1.size();i++)
					{
						count=0;
						if(visited[ar1.get(i)]==false)
						{
							dfs(ar1.get(i),visited);
							ans++;
							size.add(count);
							count=0;
						}
					}
					pln((ans+ans1)+"");
					int tmp=0;
					
					for(int i=0;i<ans;i++)
					{
						System.out.print(size.get(i)+" ");
						for(int j=tmp;j<size.get(i)+tmp;j++)
						{
							System.out.print((ar.get(j)+1)+" ");
						}
						tmp+=size.get(i);
						pln("");
					}
					for(int i=0;i<n;i++)
					{
						if(a[i]==b[i])
						{
							System.out.println("1 "+(i+1));
						}
					}
                }
    
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                /**/
                static InputReader in=new InputReader(System.in);
                    static OutputWriter out=new OutputWriter(System.out);
                    public static long l()
                    {
                        String s=in.String();
                        return Long.parseLong(s);
                    }
                    public static void pln(String value)
                    {
                        System.out.println(value);
                    }
                    public static int i()
                    {
                        return in.Int();
                    }
                    public static String s()
                    {
                        return in.String();
                    }
        }
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
             
            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 int Int() {
                    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 String String() {
                    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 String();
                }
             
                public interface SpaceCharFilter {
                    public boolean isSpaceChar(int ch);
                }
            }
             
            class OutputWriter {
                private final PrintWriter writer;
             
                public OutputWriter(OutputStream outputStream) {
                    writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
                }
             
                public OutputWriter(Writer writer) {
                    this.writer = new PrintWriter(writer);
                }
             
                public void print(Object...objects) {
                    for (int i = 0; i < objects.length; i++) {
                        if (i != 0)
                            writer.print(' ');
                        writer.print(objects[i]);
                    }
                }
             
                public void printLine(Object...objects) {
                    print(objects);
                    writer.println();
                }
             
                public void close() {
                    writer.close();
                }
             
                public void flush() {
                    writer.flush();
                }
             
                }
             
                class IOUtils {
             
                public static int[] readIntArray(InputReader in, int size) {
                    int[] array = new int[size];
                    for (int i = 0; i < size; i++)
                        array[i] = in.Int();
                    return array;
                }
             
                }