Lagrange's theorem states that any natural number can be represented as the sum of four perfect squares. For the given number n find the following representation: print from 1 to 4 natural numbers whose squares add up to the given number.
Input
The program receives as input one natural number n < 10000.
Imprint
The program should print from 1 to 4 natural numbers, the squares of which add up to the given number.
Examples
| # |
Input |
Output |
| 1 |
3 |
1 1 1 |
| 2 |
7 |
2 1 1 1 |