PROGRAMMING:The sum of squares of integer n
For a positive integer n (< 100000), we want to divide it into the sum of squares of K different positive integers x1, X2,..., XK,
That is, if n = X1 ^ 2 + x2 ^ 2 +... + XK ^ 2, find the maximum value of X1 + x2 +... + XK. If it cannot be split, output 0.
###Input format:
A positive integer n.
###Output format:
The first line corresponds to the maximum value of X1 + x2 +... + XK,
If the maximum value is not 0, then the minimum lexicographic order x1, X2... XK will be output in the next row, otherwise only 0 in the first row will be output.
###Input example:
Here is a set of inputs. For example:
```in
six
```
```in
fifty
```
```in
five thousand and one
```
###Output example:
```out
0
```
```out
twelve
1 2 3 6
```
```out
two hundred and ninety-five
1 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25
```
answer：If there is no answer, please comment
That is, if n = X1 ^ 2 + x2 ^ 2 +... + XK ^ 2, find the maximum value of X1 + x2 +... + XK. If it cannot be split, output 0.
###Input format:
A positive integer n.
###Output format:
The first line corresponds to the maximum value of X1 + x2 +... + XK,
If the maximum value is not 0, then the minimum lexicographic order x1, X2... XK will be output in the next row, otherwise only 0 in the first row will be output.
###Input example:
Here is a set of inputs. For example:
```in
six
```
```in
fifty
```
```in
five thousand and one
```
###Output example:
```out
0
```
```out
twelve
1 2 3 6
```
```out
two hundred and ninety-five
1 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 23 24 25
```
answer：If there is no answer, please comment