#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int a, b, c;
    while(cin >> a >> b >> c){
        vector<int> v(11, 1);
        v[0] = 0; v[a] = 0; v[b] = 0; v[c] = 0;
        int cnt1 = 0, cnt2 = 0;
        for (int i = 0; i <= 10; ++i) {
            if(!v[i]) continue;
            cnt2++;
            if(a+b+i <= 20) cnt1++;
        }
        if(cnt1*2 >= cnt2) puts("YES");
        else puts("NO");
    }
    return 0;
}
