#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;


int main(){
    cout << fixed << setprecision(15);
    ll a,b,c; cin >> a >> b >> c;
    if(a == 0 && b == 0 && c == 0){
        cout << -1 << endl;
        return 0;
    }
    if(a == 0 && b == 0 && c != 0){
        cout << 0 << endl;
        return 0;
    }
    if(a == 0 && b != 0){
        cout << 1 << endl;
        cout << (double)(-c)/b << endl;
        return 0;
    }
    if(b*b-4*a*c == 0){
        cout << 1 << endl;
        cout << (double)(-b)/(2*a) << endl;
    }
    else if(b*b-4*a*c < 0){
        cout << 0 << endl;
    } 
    else{
        cout << 2 << endl;
        double ans1 = ((double)(-b)+sqrt(b*b-4*a*c))/(2*a);
        double ans2 = ((double)(-b)-sqrt(b*b-4*a*c))/(2*a);
        if(a > 0){
            if(b >= 0){
                ans1 = (double)c/(a*ans2);
            }
            else ans2 = (double)c/(a*ans1);
            cout << ans2 << endl;
            cout << ans1 << endl;
        }
        else{
            if(b >= 0){
                ans1 = (double)c/(a*ans2);
            }
            else ans2 = (double)c/(a*ans1);
            cout << ans1 << endl;
            cout << ans2 << endl;
        }
    }
}