#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1005;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
long long dp[105][105];
long long C(int k, int j) {
  long long t = 1;
  for (int i = 1; i <= j; i++) t *= i;
  long long ans = 1;
  for (int i = 1; i <= j; i++) ans *= (k - i + 1);
  return ans / t;
}
int a, b, c;
double f(double x) { return a * x * x + b * x + c; }
int main() {
  while (~scanf("%d%d%d", &a, &b, &c)) {
    if (a > 0) {
      double l = -1e9, r = -0.5 * b / a;
      while (l + 1e-9 < r) {
        double mid = (l + r) * 0.5;
        if (f(mid) < -1e-9)
          r = mid;
        else
          l = mid;
      }
      double ans = -1.0 * b / a - l;
      printf("%.10f\n%.10f\n", ans, l);
    } else {
      double l = -1e9, r = -0.5 * b / a;
      while (l + 1e-9 < r) {
        double mid = (l + r) * 0.5;
        if (f(mid) > 1e-9)
          r = mid;
        else
          l = mid;
      }
      double ans = -1.0 * b / a - l;
      printf("%.10f\n%.10f\n", ans, l);
    }
  }
  return 0;
}
