PROGRAMMING:Node value and maximum layer of binary leaves
It is known that the data field of a node of a non empty binary tree is an integer not equal to 0. Please write a program to find out the layer with the largest sum of data values of nodes in the binary tree.
###Input format:
The input is a group of integers separated by spaces, the number of which is not more than 100, indicating the first root sequence of binary tree with null pointer information.
###Output format:
The output is an integer, which represents the layer with the largest sum of leaf node data values. If there are multiple layers meeting the conditions, the lowest layer is output.
###Input sample 1:
```in
1 2 0 0 3 0 0
```
###Output sample 1
```out
one
```
###Input sample 2:
```in
1 -2 0 0 3 -1 0 0 -1 0 0
```
###Output sample 2:
```out
two
```
answer：If there is no answer, please comment
###Input format:
The input is a group of integers separated by spaces, the number of which is not more than 100, indicating the first root sequence of binary tree with null pointer information.
###Output format:
The output is an integer, which represents the layer with the largest sum of leaf node data values. If there are multiple layers meeting the conditions, the lowest layer is output.
###Input sample 1:
```in
1 2 0 0 3 0 0
```
###Output sample 1
```out
one
```
###Input sample 2:
```in
1 -2 0 0 3 -1 0 0 -1 0 0
```
###Output sample 2:
```out
two
```
answer：If there is no answer, please comment