#include <iostream>
#include <algorithm>
#include <cmath>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll A, B, C;

ll f(ll x) {
  return x * x * x + A * x * x + B * x + C;
}

int main(void) {
  cin >> A >> B >> C;

  ll ans[3];
  REP(i, 0, 1000001) {
    if(f(i) == 0) { ans[0] = i; break; }
    if(f(-i) == 0) { ans[0] = -i; break; }
  }
  cout << ans[0] << endl;
  ll p = A + ans[0];
  ll q = ans[0] != 0 ? -C / ans[0] : B;
  ans[1] = (-p + sqrt(p * p - 4 * q)) / 2;
  ans[2] = (-p - sqrt(p * p - 4 * q)) / 2;
  sort(ans, ans + 3);

  cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
}