#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };


int my1, my2, ene = 0;
double N = 0;
int goal[2];
int M = 0;
vector<vector<int>>MV;


void input(void) {
	
	return;
}


int main(void) {
	bool card[10] = { false };
	int sum = 0;
	int remain = 0;
	int percent = 0;

	while (CI my1 >> my2 >> ene) {
		sum += my1 + my2;
		remain = 20 - sum;
		card[my1 - 1] = true;
		card[my2 - 1] = true;
		card[ene - 1] = true;
		for (int i = 0; i < 10; i++) {
			if (card[i] == false) {
				if (i + 1 > remain) {
					percent++;
				}
			}
		}
		if (percent > 3) {
			CO "NO" E
		}
		else {
			CO "YES" E
		}
	}

	return 0;
}