#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool prm[10000007];
long long N = 10000000;
void sieve() {
  prm[1] = 1;
  for (long long i = 2; i <= sqrt(N); i++) {
    if (prm[i] == 0) {
      for (long long j = i + i; j <= N; j = j + i) prm[j] = 1;
    }
  }
}
long long bm(long long b, long long p) {
  long long namira;
  if (p == 0) return 1;
  if (p % 2 == 0) {
    namira = bm(b, p / 2);
    return ((namira % 1000000007) * (namira % 1000000007)) % 1000000007;
  } else {
    return ((b % 1000000007) * (bm(b, p - 1) % 1000000007)) % 1000000007;
  }
}
int main() {
  double a, b, c, r1, r2, d;
  scanf("%lf%lf%lf", &a, &b, &c);
  d = b * b - 4 * a * c;
  d = sqrt(d);
  r1 = -b + d;
  r1 = (r1 * 1.0) / (2.0 * a);
  r2 = -b - d;
  r2 = (r2 * 1.0) / (2.0 * a);
  if (r2 > r1) {
    d = r1;
    r1 = r2;
    r2 = d;
  }
  printf("%.15lf", r1);
  printf("\n");
  printf("%.15lf", r2);
  printf("\n");
  return 0;
}
