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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;

	 
	public class Solution123 implements Runnable
	{
		static final int MAX = 1000000007;
		static long[] pow2 = new long[200005];
		static class InputReader
		{
			private InputStream stream;
			private byte[] buf = new byte[1024];
			private int curChar;
			private int numChars;
			private SpaceCharFilter filter;
			private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	
			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()
			{
				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);
			}
		}
	 	
		public static void main(String args[]) throws Exception
		{
			new Thread(null, new Solution123(),"Solution123",1<<26).start();
		}	
		public void run()
		{
			InputReader sc= new InputReader(System.in);
			PrintWriter w= new PrintWriter(System.out);
			int n = sc.nextInt();
			int[] arr2 = new int[n];
			int[] arr = new int[n];
			for(int i = 0;i < n;i++){
				arr2[i] = sc.nextInt();
			}
			for(int i = 0;i < n;i++){
				arr[i] = arr2[i];
			}
			Arrays.sort(arr);
			HashMap<Integer,Integer> hmap = new HashMap();
			for(int i = 0;i < n;i++){
				hmap.put(arr[i],i);
			}
			ArrayList<String> ar = new ArrayList();
			boolean[] bool = new boolean[n];
			for(int i = 0;i < n;i++){
				if(bool[i]){
					continue;
				}
				ArrayList<Integer> temp = new ArrayList();
				int count = 1;
				bool[i] = true;
				temp.add(i + 1);
				int j = hmap.get(arr2[i]);
				while(!bool[j]){
					temp.add(j+1);
					bool[j] = true;
					count++;
					j = hmap.get(arr2[j]);
				}
				StringBuilder st = new StringBuilder();
				for(int k = 0;k < temp.size();k++){
					st.append(temp.get(k) + " ");
				}
				ar.add(count + " " + st.toString());
			}
			w.println(ar.size());
			for(int i = 0;i < ar.size();i++){
				w.println(ar.get(i));
			}
			w.close();
		}
		static int lcs(String s1,String s2){
			int[][] dp = new int[s1.length() + 1][s2.length() + 1];
			for(int i = 0;i <= s1.length();i++){
				for(int j = 0;j <= s2.length();j++){
					if(i == 0 || j == 0){
						dp[i][j] = 0;
					}else if(s1.charAt(i-1) == s2.charAt(j-1)){
						dp[i][j] = dp[i-1][j-1] + 1;
					}else{
						dp[i][j] = Math.max(dp[i][j-1],dp[i-1][j]);
					}
				}
			}
			return dp[s1.length()][s2.length()];
		}
		boolean isPrime(int n) {
		    for(int i=2;i<n;i++) {
		        if(n%i==0)
		            return false;
		    }
		    return true;
		}
		static class UnionFind{
			int[] arr;
			int[] size;
			UnionFind(int length){
				arr = new int[length];
				size = new int[length];
				for(int i = 0;i < length;i++){
					arr[i] = i;
					size[i] = 1;
				}
			}
			int root(int a){
				while(arr[a] != a){
					arr[a] = arr[arr[a]];
					a = arr[a];
				}
				return a;
			}
			void union(int a,int b){
				int rootA = root(a);
				int rootB = root(b);
				if(size[rootA] < size[rootB]){
					arr[rootA] = rootB;
					size[rootB] += size[rootA];
				}else{
					arr[rootB] = rootA;
					size[rootA] += size[rootB];
				}
			}
			boolean find(int a,int b){
				if(root(a) == root(b)){
					return true;
				}else{
					return false;
				}
			}
			int ans(){
				HashSet<Integer> hset = new HashSet();
				ArrayList<Integer> ar = new ArrayList();
				for(int i = 0;i < arr.length;i++){
					int x = root(arr[i]);
					hset.add(x);
				}
				return hset.size();
			}
		}
		class Pair implements Comparable<Pair>{
			int number;
			Long max;
			Long num;
			Pair(int number,long max,long num){
				this.number = number;
				this.max = max;
				this.num = num;
			}
			@Override
			public int compareTo(Pair p){
				return p.max.compareTo(this.max);
			}
		}
	}