Problem: A rare article in the Internet is posted without a possibility to comment it. On a Polycarp's website each article has comments feed.

Each comment on Polycarp's website is a non-empty string consisting of uppercase and lowercase letters of English alphabet. Comments have tree-like structure, that means each comment except root comments (comments of the highest level) has exactly one parent comment.

When Polycarp wants to save comments to his hard drive he uses the following format. Each comment he writes in the following format: 

  * at first, the text of the comment is written; 
  * after that the number of comments is written, for which this comment is a parent comment (i. e. the number of the replies to this comments); 
  * after that the comments for which this comment is a parent comment are written (the writing of these comments uses the same algorithm). 

All elements in this format are separated by single comma. Similarly, the comments of the first level are separated by comma.

For example, if the comments look like:

<image>

then the first comment is written as "hello,2,ok,0,bye,0", the second is written as "test,0", the third comment is written as "one,1,two,2,a,0,b,0". The whole comments feed is written as: "hello,2,ok,0,bye,0,test,0,one,1,two,2,a,0,b,0". For a given comments feed in the format specified above print the comments in a different format: 

  * at first, print a integer d — the maximum depth of nesting comments; 
  * after that print d lines, the i-th of them corresponds to nesting level i; 
  * for the i-th row print comments of nesting level i in the order of their appearance in the Policarp's comments feed, separated by space. 

Input

The first line contains non-empty comments feed in the described format. It consists of uppercase and lowercase letters of English alphabet, digits and commas. 

It is guaranteed that each comment is a non-empty string consisting of uppercase and lowercase English characters. Each of the number of comments is integer (consisting of at least one digit), and either equals 0 or does not contain leading zeros.

The length of the whole string does not exceed 106. It is guaranteed that given structure of comments is valid. 

Output

Print comments in a format that is given in the statement. For each level of nesting, comments should be printed in the order they are given in the input.

Examples

Input

hello,2,ok,0,bye,0,test,0,one,1,two,2,a,0,b,0


Output

3
hello test one 
ok bye two 
a b 


Input

a,5,A,0,a,0,A,0,a,0,A,0


Output

2
a 
A a A a A 


Input

A,3,B,2,C,0,D,1,E,0,F,1,G,0,H,1,I,1,J,0,K,1,L,0,M,2,N,0,O,1,P,0


Output

4
A K M 
B F H L N O 
C D G I P 
E J 

Note

The first example is explained in the statements. 

Solution (in JAVA):

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

public class Main {
	static PrintWriter pw = new PrintWriter(System.out);

	public static void main(String[] args) throws IOException, InterruptedException {
		Scanner sc = new Scanner(System.in);
		String[] arr = sc.next().split(",");
		name = new String[arr.length / 2];
		int[] num = new int[arr.length / 2];
		for (int i = 0; i < arr.length; i += 2) {
			name[i / 2] = arr[i];
		}
		for (int i = 1; i < arr.length; i += 2) {
			num[i / 2] = Integer.parseInt(arr[i]);
		}
		adj = new ArrayList[name.length];
		for (int i = 0; i < adj.length; i++) {
			adj[i] = new ArrayList<>();
		}
		Stack<pair> st = new Stack<>();
		int p = 0;
		while (p < arr.length / 2) {
			st.add(new pair(p, num[p]));
			while (!st.isEmpty()) {
				pair x = st.pop();
				if (x.y == 0) {
					continue;
				}
				st.add(new pair(x.x, x.y - 1));
				p++;
				adj[x.x].add(p);
				st.add(new pair(p, num[p]));
			}
			p++;
		}
//		pw.println(Arrays.toString(adj));
		int depth = 0;
		visited = new boolean[arr.length / 2];
		for (int i = 0; i < num.length; i++) {
			if (!visited[i])
				depth = Math.max(depth, dfs(i));
		}
		pw.println(depth + 1);
		layers = new ArrayList[depth + 1];
		for (int i = 0; i < layers.length; i++) {
			layers[i] = new ArrayList<>();
		}
		visited = new boolean[arr.length / 2];
		for (int i = 0; i < num.length; i++) {
			if (!visited[i])
				dfs(i, 0);
		}
		for (int i = 0; i < depth + 1; i++) {
			for (int k : layers[i]) {
				pw.print(name[k] + " ");
			}
			pw.println();
		}
		pw.close();
	}

	static ArrayList<Integer>[] adj;
	static boolean[] visited;
	static String[] name;
	static ArrayList<Integer>[] layers;

	static int dfs(int u) {
		visited[u] = true;
		int ans = 0;
		for (int v : adj[u]) {
			if (!visited[v]) {
				ans = Math.max(ans, 1 + dfs(v));
			}
		}
		return ans;
	}

	static void dfs(int u, int c) {
		visited[u] = true;
		layers[c].add(u);
		for (int v : adj[u]) {
			if (!visited[v]) {
				dfs(v, c + 1);
			}
		}
	}

	public static class tuble implements Comparable<tuble> {
		int x;
		int y;
		int z;

		public tuble(int x, int y, int z) {
			this.x = x;
			this.y = y;
			this.z = z;
		}

		public String toString() {
			return x + " " + y + " " + z;
		}

		public int compareTo(tuble other) {
			if (this.x == other.x) {
				if (this.y == other.y)
					return this.z - other.z;
				return this.y - other.y;
			} else {
				return this.x - other.x;
			}
		}
	}

	public static class pair implements Comparable<pair> {
		int x;
		int y;

		public pair(int x, int y) {
			this.x = x;
			this.y = y;
		}

		public String toString() {
			return x + " " + y;
		}

		public boolean equals(Object o) {
			if (o instanceof pair) {
				pair p = (pair) o;
				return p.x == x && p.y == y;
			}
			return false;
		}

		public int hashCode() {
			return new Integer(x).hashCode() * 31 + new Integer(y).hashCode();
		}

		public int compareTo(pair other) {
			if (this.x == other.x) {
				return Long.compare(this.y, other.y);
			}
			return Long.compare(this.x, other.x);
		}
	}

	static class Scanner {
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public Scanner(FileReader r) {
			br = new BufferedReader(r);
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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

		public String nextLine() throws IOException {
			return br.readLine();
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

	}

}