#include <bits/stdc++.h>
using namespace std;
template <class T>
T GCD(T a, T b) {
  if (a == 0) return b;
  return GCD(b % a, a);
}
template <class T>
T modpow(T x, T p) {
  T res = 1;
  while (p > 0) {
    if (p & 1) res *= x;
    x *= x;
    p /= 2;
  }
  return res;
}
template <class T>
void print(T a[], long long n) {
  for (long long i = 0; i < n; i++) std::cout << a[i] << ' ';
  cout << endl;
}
template <class T>
void printc(T c) {
  for (auto const &v : c) std::cout << v << ' ';
  cout << endl;
}
struct HASH {
  size_t operator()(const pair<long, long> &x) const {
    return hash<long long>()(((long long)x.first) ^
                             (((long long)x.second) << 32));
  }
};
bool pair_sort(const pair<int, int> &p1, const pair<int, int> &p2) {
  if (p1.first != p2.first)
    return p1.first < p2.first;
  else
    return p1.second < p2.second;
}
const int INF = std::numeric_limits<int>::max();
const long long M_INF = std::numeric_limits<long long>::min();
void solution();
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solution();
  return 0;
}
void solution() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long left = a * b * 4;
  long long v = c - a - b;
  long long right = (c - a - b) * (c - a - b);
  if (v > 0 && left < right) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
