Codeforces Round #416 (Div. 2) has been moved to start on 27.05.2017 09:35 (UTC). ×

A. Quadratic equation
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a quadratic equation with integer coefficients A * X2 + B * X + C = 0. It is guaranteed that A ≠ 0 and that the equation has at least one real root. Output the roots of the equation.

Input

The only line of input contains integers A, B and C ( - 1000 ≤ A, B, C ≤ 1000, A ≠ 0), separated by spaces.

Output

Output the roots of the equation in increasing order. If the equation has a single root of multiplicity 2, output it once. The root is considered to be correct if its absolute or relative error does not exceed 10 - 4.

Examples
Input
1 -2 1
Output
1
Input
1 0 -1
Output
-1 1
Input
2 -3 1
Output
0.5 1