package no360;

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int[] a = new int[7];
		for(int i=0;i<7;i++) {
			a[i] = sc.nextInt();
		}
		Arrays.sort(a);
		do {
			if (isIncreasingKadomatsuSequenceSequence(a)) {
				System.out.println("YES");
				return;
			}
		} while(nextPermutation(a));
		System.out.println("NO");
	}
	public static boolean isKadomatsuSequence(long a,long b,long c) {
		if (a == b || b == c || a == c) {
			return false;
		}
		return b < a && b < c || b > a && b > c;
	}
	public static boolean isIncreasingKadomatsuSequence(long a,long b,long c) {
		return a < c && isKadomatsuSequence(a, b, c);
	}
	public static boolean isIncreasingKadomatsuSequenceSequence(int[] a) {
		for(int i=0;i<a.length-2;i++) {
			if (!isIncreasingKadomatsuSequence(a[i], a[i+1], a[i+2])) {
				return false;
			}
		}
		return true;
	}
	static boolean nextPermutation(int[] p) {
		for(int a=p.length-2;a>=0;--a) {
			if(p[a]<p[a+1]) {
				for(int b=p.length-1;;--b) {
					if(p[b]>p[a]) {
						int t = p[a];
						p[a] = p[b];
						p[b] = t;
						for(++a, b=p.length-1;a<b;++a,--b) {
							t = p[a];
							p[a] = p[b];
							p[b] = t;
						}
						return true;
					}
				}
			}
		}
		return false;
	}
}