#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define double long double
int main()
{
	ll a, b, c;
	cin>>a>>b>>c;
	if(a==0){
		if(b==0){
			if(c!=0){
				cout<<0<<endl;
			}else{
				cout<<-1<<endl;
			}
		}else{
			cout<<1<<endl;
			printf("%.12Lf\n", (double)(-c)/(double)b);
		}
		return 0;
	}
	if(a<0){
		a=-a;
		b=-b;
		c=-c;
	}
	ll d=b*b-4*a*c;
	if(d==0){
		cout<<1<<endl;
		printf("%.12Lf\n", (double)(-b)/(double)(2*a));
	}else if(d<0){
		cout<<0<<endl;
	}else{
		cout<<2<<endl;
		double mid=-(double)b/(double)(2*a);
		double l=mid, r=2e9;
		for(int i=0; i<200; i++){
			double m=(l+r)/2;
			if(a*m*m+b*m+c<0) l=m;
			else r=m;
		}
		printf("%.12Lf\n", 2*mid-r);
		printf("%.12Lf\n", r);
	}
	return 0;
}