import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum EPS = 1e-12L;

real co(real a, real b, real c) {
  return (b^^2 + c^^2 - a^^2) / (2 * b * c);
}

void main() {
  try {
    for (; ; ) {
      const A = readLong;
      const B = readLong;
      const C = readLong;
      
      bool ans;
      foreach (D; 1 .. B+C) foreach (E; 1 .. B+C) {
        if (B + C > D+A+E && C + D+A+E > B && D+A+E + B > C) {
          const real a = A;
          const real b = B;
          const real c = C;
          const real d = D;
          const real e = E;
          const real f = D+A+E;
          const p = co(c, b, f);
          const q = co(b, c, f);
          const ad = sqrt(b^^2 + d^^2 - 2 * b * d * p);
          const ae = sqrt(c^^2 + e^^2 - 2 * c * e * q);
          const r = co(d, b, ad);
          const s = co(e, c, ae);
          if (abs(r - s) <= EPS) {
            debug {
              writeln([a, b, c, d, e,f , p, q, ad, ae, r, s]);
            }
            ans = true;
          }
        }
      }
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}