#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;

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)/b);
		}
		return 0;
	}
	ll d=b*b-4*a*c;
	if(d==0){
		cout<<1<<endl;
		printf("%.12lf\n", (double)(-b)/(2*a));
	}else if(d<0){
		cout<<0<<endl;
	}else{
		cout<<2<<endl;
      double ans[2];
      if(b>=0) ans[0]=(-b-sqrt((double)d))/(2*a);
      else ans[0]=(-b+sqrt((double)d))/(2*a);
      ans[1]=(double)c/a/ans[0];
      sort(ans, ans+2);
      for(int i=0; i<2; i++) printf("%.12lf\n", ans[i]);
	}
	return 0;
}