//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;



int main(){

    ll a, b, c;
    cin >> a >> b >> c;
    if(a == 0 && b == 0 && c == 0){
        cout << -1 << endl;
        return 0;
    }
    if(b * b - 4 * a * c < 0){
        cout << 0 << endl;
        return 0;
    }
    if(b * b - 4 * a * c == 0){
        cout << 1 << endl;
        double ans = -b / ((double)2.0 * a);
        printf("%.20f\n", ans);
        return 0;
    }
    cout << 2 << endl;
    double d = sqrt(b * b - 4 * a * c);
    double x1 = (-b + d) / ((double)2.0 * a);
    double x2 = (-b - d) / ((double)2.0 * a);
    printf("%.20f\n", min(x1, x2));
    printf("%.20f\n", max(x1, x2));
    
    return 0;
}