#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector dp(51, vector(51, vector<int>(51, -1)));
int rec(int A, int B, int C){
    if(dp[A][B][C] != -1) return dp[A][B][C];
    if(B > C) return dp[A][B][C] = rec(A, C, B);
    if(A > B) return dp[A][B][C] = rec(B, A, C);
    for(int i = 1; i < A; i++){
        if(rec(i, B, C) && rec(A - i, B, C)) return dp[A][B][C] = 1;
    }
    for(int i = 1; i < B; i++){
        if(rec(A, i, C) && rec(A, B - i, C)) return dp[A][B][C] = 1;
    }
    for(int i = 1; i < C; i++){
        if(rec(A, B, i) && rec(A, B, C - i)) return dp[A][B][C] = 1;
    }
    return dp[A][B][C] = 0;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    array<ll, 3> A;
    cin >> A[0] >> A[1] >> A[2];
    sort(A.begin(), A.end());
    dp[1][2][3] = 1;
    A[0] %= 24, A[1] %= 24, A[2] %= 24;
    cout << (rec(A[0], A[1], A[2]) ? "Yes" : "No") << '\n';
}