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.
import java.util.*;
import java.io.*;
import java.lang.reflect.Array;

public class AIMTECH4C 
{
	static class DisjointSet
	{
		Map<Long, Node> map=new HashMap<>();
		public class Node
		{
			Node parent;
			long data;
			int rank;
		}
		
		public void makeSet(long data)
		{
			Node node=new Node();
			node.parent=node;
			node.data=data;
			node.rank=0;
			map.put(data, node);
		}
		public long findSet(long data)
		{
			return findSet(map.get(data)).data;
		}
		
		private Node findSet(Node node)
		{
			Node parent=node.parent;
			if(parent==node)
				return parent;
			
			node.parent=findSet(node.parent);
			return node.parent;
		}
		public void union(long data1,long data2)
		{
			Node n1=map.get(data1);
			Node n2=map.get(data2);
			Node parent1=findSet(n1);
			Node parent2=findSet(n2);
			if(parent1.rank==parent2.rank)
			{
				parent1.rank++;
				parent2.parent=parent1;
			}
			else if(parent1.rank<parent2.rank)
				parent1.parent=parent2;
			else
				parent2.parent=parent1;	
		}
	}
	public static void main(String args[]) {
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		/*------------------------------My Code starts here------------------------------*/
		int i,n=in.nextInt(),j;
		int[] a=nextIntArray(in, n);
		int[] b=new int[n];
		DisjointSet ds=new DisjointSet();
		for(i=1;i<=n;i++)
		{
			ds.makeSet(i);
			b[i-1]=a[i-1];
		}
		Arrays.sort(b);
		Map<Integer, Integer> hm=new HashMap<>();
		Map<Integer, Integer> h=new HashMap<>();
		for(i=0;i<n;i++)
		{
			hm.put(b[i], i);
		}
		for(i=0;i<n;i++)
			ds.union(i+1, hm.get(a[i])+1);
		ArrayList<ArrayList<Integer>> al=new ArrayList<ArrayList<Integer>>();
		for(i=1;i<=n;i++)
		{
			int t=(int)ds.findSet(i);
			if(!h.containsKey(t))
			{
				al.add(new ArrayList<Integer>());
				h.put(t, al.size()-1);
			}
			al.get(h.get(t)).add(i);
		}
		out.println(al.size());
		for(i=0;i<al.size();i++)
		{
			out.print(al.get(i).size()+" ");
			for(j=0;j<al.get(i).size();j++)
				out.print(al.get(i).get(j)+" ");
			out.println();
		}
		out.close();
		/*------------------------------The End------------------------------------------*/
	}

	public static final long l = (int) (1e9 + 7);

	private static int[] nextIntArray(InputReader in, int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = in.nextInt();
		return a;
	}

	private static long[] nextLongArray(InputReader in, int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = in.nextLong();
		return a;
	}

	private static int[][] nextIntMatrix(InputReader in, int n, int m) {
		int[][] a = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++)
				a[i][j] = in.nextInt();
		}
		return a;
	}

	private static void show(int[] a) {
		for (int i = 0; i < a.length; i++)
			System.out.print(a[i] + " ");
		System.out.println();
	}

	private static void show2DArray(char[][] a) {
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[0].length; j++)
				System.out.print(a[i][j]);
			System.out.println();
		}
	}

	static class Pair {
		private int first;
		private int second;

		public Pair(int i, int j) {
			this.first = i;
			this.second = j;
		}

		public int getFirst() {
			return first;
		}

		public int getSecond() {
			return second;
		}

		public void setFirst(int k) {
			this.first = k;
		}

		public void setSecond(int k) {
			this.second = k;
		}
	}

	static int modPow(int a, int b, int p) {
		int result = 1;
		a %= p;
		while (b > 0) {
			if ((b & 1) != 0)
				result = (result * a) % p;
			b = b >> 1;
			a = (a * a) % p;
		}
		return result;
	}

	public static void SieveOfEratosthenes(int n) {
		boolean[] prime = new boolean[n + 1];
		Arrays.fill(prime, true);
		prime[1] = false;
		int i, j;
		for (i = 2; i * i <= n; i++) {
			if (prime[i]) {
				for (j = i; j <= n; j += i) {
					if (j != i)
						prime[j] = false;
				}
			}
		}
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine() {
			String fullLine = null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine = reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}
	}

}
