import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


A = LI()
B = LI()


def is_kadomatsu(X):
    if X[0] != X[1] != X[2] != X[0] and (max(X) == X[1] or min(X) == X[1]):
        return True
    return False


for i in range(3):
    for j in range(3):
        X = A[:]
        Y = B[:]
        X[i],Y[j] = Y[j],X[i]
        if is_kadomatsu(X) and is_kadomatsu(Y):
            print('Yes')
            break
    else:
        continue
    break
else:
    print('No')