import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

from decimal import *

a, b, c = map(Decimal, SI().split())
# 問題で「方程式」って言ってるから本当はa=b=0はナシだと思うけど念の為
if a == b == 0:
    if c == 0:
        print(-1)
    else:
        print(0)
elif a == 0:
    ans = -c/b
    print(1, ans)
elif b**2-4*a*c > 0:
    a0 = (-b-(b**2-4*a*c).sqrt())/(2*a)
    a1 = (-b+(b**2-4*a*c).sqrt())/(2*a)
    print(2)
    print(a0)
    print(a1)
elif b**2-4*a*c == 0:
    a0 = -b/(2*a)
    print(1)
    print(a0)
else:
    print(0)