from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def check(aa):
        for a0, a1, a2 in zip(aa, aa[1:], aa[2:]):
            if a0 == a1 or a1 == a2 or a0 == a2: return False
            if a0 <= a1 <= a2: return False
        return True

    dd = LI()
    dd.sort()
    for odd in combinations(range(7), 3):
        ei = 0
        oi = 1
        aa = [0] * 7
        for i in range(7):
            if i in odd:
                aa[oi] = dd[i]
                oi += 2
            else:
                aa[ei] = dd[i]
                ei += 2
        # print(aa)
        if check(aa):
            print("YES")
            exit()
    print("NO")

main()