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.
numlis = [int(i) for i in list(input())]
ans = -1
for num in numlis:
    if num == 0 or num == 8:
        ans = num
        break
if ans != -1:
    print('YES')
    print(ans)
else:
    for i1 in range(len(numlis) - 1):
        num1 = numlis[i1]
        for i2 in range(i1+1, len(numlis)):
            if (num1 * 10 + numlis[i2]) % 8 == 0:
                ans = num1 * 10 + numlis[i2]
                break
        if ans != -1: break
    if ans != -1:
        print('YES')
        print(ans)
    else:
        for j1 in range(len(numlis) - 2):
            num1 = numlis[j1]
            for j2 in range(j1+1, len(numlis)-1):
                num2 = numlis[j2]
                for j3 in range(j2+1, len(numlis)):
                    if (num1 * 100 + num2 * 10 + numlis[j2]) % 8 == 0:
                        ans = num1 * 100 + num2 * 10 + numlis[j2]
                        break
                if ans != -1: break
            if ans != -1: break
        if ans != -1:
            print('YES')
            print(ans)
        else:
            print('NO')