#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef pair<double,double> P;
typedef complex<double> CP;
typedef long long ll;



bool card[12];
int a,b,c;

int main(){
	while(cin>>a>>b>>c){
		rep(i,12) card[i]=false;
		card[a]=card[b]=card[c]=true;
		rep(i,12){
			//cout<<i<<" "<<card[i]<<endl;
		}
		int sum=a+b;
		int co=0;
		for(int i=1;i<11;i++){
			if(!card[i]&&sum+i<=20){
				//cout<<i<<endl;
				co++;
			}
			//else if(sum+i>20) break;
		}
		//double ka=(double) co/17;
		//cout<<co<<endl;
		if(co>4) cout<<"YES\n";
		else cout<<"NO\n";
	}
	return 0;
}