Problem: You are given an equation: 

Ax2 + Bx + C = 0. 

Your task is to find the number of distinct roots of the equation and print all of them in ascending order.

Input

The first line contains three integer numbers A, B and C ( - 105 ≤ A, B, C ≤ 105). Any coefficient may be equal to 0.

Output

In case of infinite root count print the only integer -1. In case of no roots print the only integer 0. In other cases print the number of root on the first line and the roots on the following lines in the ascending order. Print roots with at least 5 digits after the decimal point.

Examples

Input

1 -5 6


Output

2
2.0000000000
3.0000000000

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
 
public class GenericProblem
{
	/*
	 * This FastReader code is taken from GeeksForGeeks.com
	 * https://www.geeksforgeeks.org/fast-io-in-java-in-competitive-programming/
	 * 
	 * The article was written by Rishabh Mahrsee
	 */
	public static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    }

	
	public static FastReader file = new FastReader();
	public static PrintWriter out = new PrintWriter(System.out);

	public static void main(String[] args)
	{
		double a = file.nextInt(), b = file.nextInt(), c = file.nextInt();
		
		if (a == 0 && b == 0 && c == 0)
		{
			out.println(-1);
			out.close();
			return;
		}
		
		if (a == 0 && b == 0)
		{
			out.println(0);
			out.close();
			return;
		}
		
		if (a == 0)
		{
			out.println(1);
			out.printf("%.15f\n", -c / b);
			out.close();
			return;
		}
			
		
		double discriminant = b*b - 4*a*c;
		
		if (discriminant < 0)
		{
			out.println(0);
		}
		else if (discriminant == 0)
		{
			out.println(1);
			out.printf("%.15f\n", -b / (2 * a));
		}
		else
		{
			out.println(2);
			double[] roots = new double[2];
			
			roots[0] = (-b + Math.sqrt(discriminant)) / (2 * a);
			roots[1] = (-b - Math.sqrt(discriminant)) / (2 * a);
			
			Arrays.sort(roots);
			
			out.printf("%.15f\n", roots[0]);
			out.printf("%.15f\n", roots[1]);
		}
		
		out.close();
	}


}