#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const long double EPS = 1e-11;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(30);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  long long A, B, C; cin >> A >> B >> C;
  long double a = A, b = B, c = C;
  if (A == 0) {
    if (B == 0) {
      cout << (C == 0 ? -1 : 0) << '\n';
    } else {
      cout << "1\n" << -c / b << '\n';
    }
  } else {
    long long D = B * B - 4LL * A * C;
    if (D == 0) {
      cout << "1\n" << -b / (a * 2) << '\n';
    } else if (D > 0) {
      long double x1 = (abs(b) + sqrtl(D)) / (a * 2);
      if (b >= 0) x1 = -x1;
      long double x2 = c / (a * x1);
      cout << "2\n" << min(x1, x2) << '\n' << max(x1, x2) << '\n';
    } else {
      cout << "0\n";
    }
  }
  return 0;
}