#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <math.h>
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };
typedef tuple<ll, ll, ll>T;


int check(vector<int>temp) {
	int cnt = 0;
	rep(i, 0, 5) {
		if (temp[i] != temp[i+1] && temp[i+1] != temp[i+2] && temp[i]) {
			if (temp[i] < temp[i + 2]) {
				if (min(temp[i], temp[i + 2]) > temp[i + 1] || max(temp[i], temp[i + 2]) < temp[i + 1]) {
					cnt++;
				}
			}
		}
	}

	return cnt == 5;
}

int main() {
	vector<int>d(7);

	rep(i, 0, 7)cin >> d[i];
	sort(all(d));


	do {
		if (check(d)) {
			cout << "YES" << endl;
			return 0;
		}
	} while (next_permutation(all(d)));
	cout << "NO" << endl;

	return 0;
}