#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

using u128 = unsigned __int128;
using i128 = __int128;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int A, B, C;
    std::cin >> A >> B >> C;

    std::vector<int> d = {1, 2, 3};
    // 枚举每个方向，判断可不可平铺放下
    do {
        if (A % d[0] == 0 && B % d[1] == 0 && C % d[2] == 0) {
            std::cout << "Yes";
            return 0;
        }
    } while(std::next_permutation(d.begin(), d.end())); 

    // 除了平铺，还可以组合放置。判断是否存在6，由 1x2x6和1x3x6 组合
    // 总的来说充要条件为：至少一个偶数，至少一个3
    bool div6 = (A % 2 == 0 || B % 2 == 0 || C % 2 == 0) && (A % 3 == 0 || B % 3 == 0 || C % 3 == 0);
    bool ok = (A > 1) + (B > 1) + (C > 1) >= 2;
    std::cout << ((div6 && ok) ? "Yes" : "No");

    return 0;
}