#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1000000000000000;
template <class T>
inline bool chmin(T& first, T second) {
  if (first > second) {
    first = second;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& first, T second) {
  if (first < second) {
    first = second;
    return true;
  }
  return false;
}
long long maxx(long long x, long long y, long long z) {
  return max(max(x, y), z);
}
long long minn(long long x, long long y, long long z) {
  return min(min(x, y), z);
}
long long gcd(long long x, long long y) {
  if (x % y == 0)
    return y;
  else
    return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x * (y / gcd(x, y)); }
vector<long long> pw2(51, 1);
vector<long long> pw10(19, 1);
long long high_order_bit(long long n) {
  long long tmp = 1, i = -1;
  while (tmp <= n) {
    tmp *= 2;
    i++;
  }
  if (n == 0)
    return 0;
  else
    return i;
}
vector<long long> binary_expansion(long long n) {
  vector<long long> B(high_order_bit(n) + 1);
  long long tmp = n;
  for (long long i = high_order_bit(n); i >= 0; i--) {
    B[i] = tmp / pw2[i];
    tmp %= pw2[i];
  }
  return B;
}
vector<long long> divisor(long long x) {
  vector<long long> div;
  for (int i = 1; i * i <= x; i++) {
    if (i * i != x && x % i == 0) {
      div.push_back(i);
      div.push_back(x / i);
    } else if (x % i == 0)
      div.push_back(i);
  }
  return div;
}
vector<long long> vectorprime(long long x) {
  vector<bool> is_prime(x + 1);
  vector<long long> prime;
  for (long long i = 0; i < (x + 1); i++) is_prime[i] = true;
  is_prime[0] = is_prime[1] = false;
  for (int i = 2; i <= x; i++) {
    if (is_prime[i]) {
      prime.push_back(i);
    }
    for (int j = i * 2; j <= x; j += i) is_prime[j] = false;
  }
  return prime;
}
int main() {
  {
    for (long long i = 1; i <= (50); i++) pw2[i] = 2 * pw2[i - 1];
  }
  {
    for (long long i = 1; i <= (18); i++) pw10[i] = 10 * pw10[i - 1];
  }
  long long A, B, C;
  cin >> A >> B >> C;
  if (C - A - B > 0) {
    cout << (4 * A * B < (C - A - B) * (C - A - B) ? "Yes" : "No");
  } else
    cout << "No";
}
