You are given a non-negative integer *n*, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.

Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove any digit at all) so that the result contains at least one digit, forms a non-negative integer, doesn't have leading zeroes and is divisible by 8. After the removing, it is forbidden to rearrange the digits.

If a solution exists, you should print it.
The single line of the input contains a non-negative integer *n*. The representation of number *n* doesn't contain any leading zeroes and its length doesn't exceed 100 digits.

n = input()

for i in range(len(n)-1, -1, -1):
    newN = n[:i] + n[i + 1:]
    if i < len(n) - 4 or (int(newN[-4:]) % 8 == 0 and (len(newN) == 1 or newN[0] != "0")):
        print("YES")
        print(n[:i] + n[i+1:])
        exit()
print("NO")