#include <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>

using namespace std;

#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))

typedef complex<double> P;
typedef long long ll;

const int MAX_SIZE = 10000;

int main(){

	int c[3];
	while(cin >> c[0] >> c[1] >> c[2]){
		bool card[11];
		fill(card,card+11,false);
		for(int i = 0; i <= 2; i++)
			card[c[i]] = true;
		int sum = c[0] + c[1];

		int cnt=0;
		int match=0;
		for(int i = 1; i < 11; i++){
			if(card[i])
				continue;
			if(sum + i <= 20)
				match++;
			cnt++;
		}
		if(2*match/cnt >= 1)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	return 0;
}