A=[]
MX=[]
for _ in range(8):
    a=list(map(int,list(input())))
    A.append(a)
    MX.append(max(a))
def find_max_row(rest):
    mx=-1
    mx_i=-1
    for i in rest:
        if MX[i]>mx:
            mx=MX[i]
            mx_i=i
    return mx_i
def can_subtract(a,b):
    ok=1
    for ai,bi in zip(a,b):
        if ai<bi:ok=0;break
    return ok
def subtract(a,b):
    for i in range(8):
        a[i]-=b[i]
    return a
def dfs(A1:list,rest:set):
    if len(rest)==0:
        if sum(A1)==0:exit(print("Yes"))
        return
    row=find_max_row(rest)
    if max(A1)<max(A[row]):return
    for _ in range(8):
        if can_subtract(A1,A[row]):
            dfs(subtract(A1[:],A[row]),rest-{row})
        A[row]=A[row][1:]+[A[row][0]]
    pass
rest=set([i for i in range(1,8)])
dfs(A[0][:],rest)
print("No")