#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main(){
  ll a,b,c;
  cin>>a>>b>>c;
  ll d = b*b-4*a*c;
  if(a==0&&b==0&&c==0){
    cout << -1 << endl;
  }
  else if(a==0&&b==0){
    cout << 0 << endl;
  }
  else if(a==0){
    cout << 1 << endl;
    long double n1 = -c;
    long double n2 = b;
    printf("%20.20Lf\n", n1/n2);
  }
  else if(d<0){
    cout << 0 << endl;
  }
  else if(d==0){
    cout << 1 << endl;
    long double n1 = -b;
    long double n2 = 2*a;
    printf("%20.20Lf\n", n1/n2);
  }
  else{
    cout << 2 << endl;
    long double n1 = -b;
    long double n2 = b*b-4*a*c;
    long double n3 = 2*a;
    long double n4 = sqrt(n2);
    if(a>0){
      printf("%20.20Lf\n", (n1-n4)/n3);
      printf("%20.20Lf\n", (n1+n4)/n3);
    }
    else{
      printf("%20.20Lf\n", (n1+n4)/n3);
      printf("%20.20Lf\n", (n1-n4)/n3);
    }
  }
  return 0;
}