from itertools import permutations


def isKadomatsu(*A):
    s = set(A)
    if len(s) < 3:
        return False
    med = sorted(A)[1]
    return True if A.index(med) != 1 else False


def solve():
    L = list(map(int, input().split()))

    for l in permutations(L):
        if not (l[0] < l[2] < l[4] < l[6]):
            continue
        if not (l[1] < l[3] < l[5]):
            continue
        if all(isKadomatsu(l[i], l[i + 1], l[i + 2]) for i in range(5)):
            print('YES')
            return
    print('NO')


if __name__ == '__main__':
    solve()