PROGRAMMING:The degree of each layer of binary tree is 1 node
Write a program to count the number of nodes with degree 1 in each layer of a non empty binary tree. The number of nodes in the binary tree is not more than 100.
###Input format:
The input is a string representing the first root sequence of binary tree with null pointer information. The null pointer information is represented by #, and the node of binary tree is A-Z, the letter of A-Z.
###Output format:
The output is several rows, and the number of nodes with degree 1 of each layer is output according to the order of the number of layers from small to large, that is, the number of nodes with degree 1 of the first layer is output from the first row, the number of nodes with degree 1 of the first layer is output from the second row, and so on.
###Input example:
```in
ABD###CE###
```
###Output example:
```out
0
two
0
```
answer：If there is no answer, please comment
###Input format:
The input is a string representing the first root sequence of binary tree with null pointer information. The null pointer information is represented by #, and the node of binary tree is A-Z, the letter of A-Z.
###Output format:
The output is several rows, and the number of nodes with degree 1 of each layer is output according to the order of the number of layers from small to large, that is, the number of nodes with degree 1 of the first layer is output from the first row, the number of nodes with degree 1 of the first layer is output from the second row, and so on.
###Input example:
```in
ABD###CE###
```
###Output example:
```out
0
two
0
```
answer：If there is no answer, please comment