/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<ll, ll>;

constexpr double PI = 3.14159265358979323846;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());

class ax {
public:
    void solve(istream& cin, ostream& cout) {
      SPEED;
      cout << setprecision(16) << fixed;
      ll a, b, c; cin >> a >> b >> c;
      long double la = a;
      long double lb = b;
      long double lc = c;
      if (a==0) {
        if (b==0) {
          if (c==0) {
            cout << -1 << endl;
          } else {
            cout << 0 << endl;
          }
        } else {
          //cout << 1 << endl;
          //cout << -lc/lb << endl;
        }
      } else {
        auto det = b*b-(4*a*c);
        if (det > 0) {
          auto ans = -lb/(2*la);
          auto ans2 = abs(sqrt((long double)det)/(2*la));
          cout << 2 << endl;
          cout << ans-ans2 << endl;
          cout << ans+ans2 << endl;
        } else if (det == 0) {
          auto ans = -lb/(2*la);
          cout << 1 << endl;
          cout << ans << endl;
        } else {
          cout << 0 << endl;
        }
      }
    }
};

signed main() {
  ax solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}