B. Bauru
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In Bauru, the numbering of buildings is quite unique. Instead of the address being just Street $$$r$$$ Number $$$Y$$$, it is in the form: Street $$$r$$$ Block $$$Y$$$ Number $$$Z$$$. To simplify writing, the address is usually shortened to: Street $$$r$$$, Number $$$Y-Z$$$, that is, combining the block number with the building number. For example: Darcy Ribeiro Street, $$$9-75$$$ (block $$$9$$$, number $$$75$$$).

Dhara lives in Bauru, and one of her friends sent her a message asking her to send a package to Quintino Street, $$$A-B$$$ (block $$$A$$$, number $$$B$$$). However, instead of separating $$$A-B$$$, the message presented the two numbers together, in the form $$$AB$$$!

Help Dhara to separate the message $$$AB$$$ into $$$A$$$ and $$$B$$$, so that she can send the package. To do this, consider that $$$A$$$ and $$$B$$$ are numbers between $$$1$$$ and $$$99$$$ and that they were not written with leading zeros (for example: if $$$A = 1$$$, it cannot have been written as $$$01$$$ or $$$0001$$$, only $$$1$$$).

Input

The input contains only one line, with the message $$$AB$$$. $$$AB$$$ is a numeric string that has between $$$2$$$ to $$$4$$$ digits.

It is guaranteed that $$$AB$$$ can be formed from valid numbers $$$A$$$ and $$$B$$$, according to the statement.

Output

If it is possible to uniquely separate $$$AB$$$ into $$$A$$$ and $$$B$$$, print $$$A$$$ and $$$B$$$ separated by a space, on a single line.

Otherwise, that is, if there are multiple valid $$$A$$$ and $$$B$$$ that can form $$$AB$$$, print $$$-1$$$.

Examples
Input
975
Output
-1
Input
11
Output
1 1
Input
1010
Output
10 10
Input
120
Output
1 20