from collections import deque

p = input().strip()
digits = list(map(int, reversed(p)))  # Process from least significant digit
m = len(digits)

visited = set()
queue = deque()
queue.append((0, 0, False, False))
visited.add((0, 0, False, False))

found = False

while queue:
    i, carry_in, a_has, b_has = queue.popleft()
    
    if i == m:
        if carry_in == 0 and a_has and b_has:
            found = True
            break
        continue
    
    current_digit = digits[i]
    for a_digit in [0, 6, 7]:
        for b_digit in [0, 6, 7]:
            sum_val = a_digit + b_digit + carry_in
            if sum_val % 10 != current_digit:
                continue
            carry_out = sum_val // 10
            new_a_has = a_has or (a_digit != 0)
            new_b_has = b_has or (b_digit != 0)
            new_state = (i + 1, carry_out, new_a_has, new_b_has)
            if new_state not in visited:
                visited.add(new_state)
                queue.append(new_state)

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