#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(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  int A, B, C; cin >> A >> B >> C;
  long double a = A, b = B, c = C;
  if (A == 0) {
    if (B == 0) {
      cout << "-1\n";
    } else {
      cout << "1\n" << -c / b << '\n';
    }
  } else {
    assert(false);
    long double D = b * b - a * c * 4;
    if (abs(D) < EPS) {
      cout << 1 << '\n' << -b / (a * 2) << '\n';
    } else if (D >= EPS) {
      vector<long double> ans{(-b + sqrt(D)) / (a * 2), (-b - sqrt(D)) / (a * 2)};
      sort(ALL(ans));
      cout << 2 << '\n' << ans[0] << '\n' << ans[1] << '\n';
    } else {
      cout << 0 << '\n';
    }
  }
  return 0;
}