def k(X):
  if len(set(X))!=3 or sum(X)-min(X)-max(X)==X[1]:
    return 0
  return 1

A=[list(map(int,input().split())) for i in range(2)]
for i in range(3):
  for j in range(3):
    A[0][i],A[1][j]=A[1][j],A[0][i]
    if k(A[0]) and k(A[1]):
      print('Yes')
      exit()
    A[0][i],A[1][j]=A[1][j],A[0][i]
print('No')