#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void) 0
#endif

struct NF {
    i64 n, d;
    NF() : n(0), d(1) {}
    NF(i64 n) : n(n), d(1) {}
    NF(i64 _n, i64 _d) : n(_n), d(_d) {
        assert(d != 0);
        i64 g = gcd(n, d);
        n /= g;
        d /= g;
        if (d < 0) {
            n = -n;
            d = -d;
        }
    }
    friend bool operator==(NF x, NF y) {
        return x.n == y.n && x.d == y.d;
    }
    friend bool operator<(NF x, NF y) {
        return x.n * y.d < y.n * x.d;
    }
    friend NF operator+(NF x, NF y) {
        return NF{x.n * y.d + y.n * x.d, x.d * y.d};
    }
    friend NF operator-(NF x, NF y) {
        return NF{x.n * y.d - y.n * x.d, x.d * y.d};
    }
    friend NF operator*(NF x, NF y) {
        return NF{x.n * y.n, x.d * y.d};
    }
    friend NF operator/(NF x, NF y) {
        return NF{x.n * y.d, x.d * y.n};
    }
    friend ostream &operator<<(ostream &os, NF x) {
        os << x.n << "/" << x.d;
        return os;
    }
};

int main() {
    i64 a, b, c;
    cin >> a >> b >> c;
    bool ans = false;
    REP(l, 1, b + c) {
        REP(r, 1, b + c) {
            i64 d = l + a + r;
            if (b >= c + d || c >= d + b || d >= b + c) {
                continue;
            }
            //cerr << l << ' ' << r << ' ' << b << ' ' << c << ' ' << d << '\n';
            NF cosb = NF(b * b + d * d - c * c, 2 * b * d);
            NF cosc = NF(c * c + d * d - b * b, 2 * c * d);
            //cerr << cosb << ' ' << cosc << '\n';
            NF ad2 = NF(b * b + l * l) - NF(2 * b * l) * cosb;
            NF ae2 = NF(c * c + r * r) - NF(2 * c * r) * cosc;
            //cerr << ad2 << ' ' << ae2 << '\n';
            NF cosl = (NF(b * b - l * l) + ad2) * (NF(b * b - l * l) + ad2) / (NF(4 * b * b) * ad2);
            NF cosr = (NF(c * c - r * r) + ae2) * (NF(c * c - r * r) + ae2) / (NF(4 * c * c) * ae2);
            if (cosl == cosr) {
                ans = true;
            }
        }
    }
    cout << (ans ? "Yes\n" : "No\n");
}