#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	ll a, b, c;
	cin >> a >> b >> c;
	ll disc = b * b - 4 * a * c;
	if (a == 0) {
		if (b == 0) {
			if (c == 0) puts("-1");
			else puts("0");
		}
		else printf("1\n%.30f\n", (double)(-c) / b);
	}
	else if (disc < 0) puts("0");
	else if (disc == 0) printf("1\n%.30f\n", -(double)b / (2 * a));
	else {
		double x1, x2;
		if (b > 0) {
			x1 = (-b - sqrt(disc)) / (2 * a);
			x2 = (2 * c) / (-b - sqrt(disc));
		}
		else {
			x1 = (-b + sqrt(disc)) / (2 * a);
			x2 = (2 * c) / (-b + sqrt(disc));
		}
		if (x1 > x2) swap(x1, x2);
		printf("2\n%.30f\n%.30f\n", x1, x2);
	}
	
}