def is_kadomatsu(v):
    if len(set(v)) != 3:
        return False
    middle = v[1]
    max_val = max(v)
    min_val = min(v)
    return middle == max_val or middle == min_val

a = list(map(int, input().split()))
b = list(map(int, input().split()))

found = False

for i in range(3):
    for j in range(3):
        new_a = a.copy()
        new_b = b.copy()
        new_a[i], new_b[j] = new_b[j], new_a[i]
        if is_kadomatsu(new_a) and is_kadomatsu(new_b):
            found = True
            break
    if found:
        break

print("Yes" if found else "No")