You have number *a*, whose decimal representation quite luckily contains digits 1, 6, 8, 9. Rearrange the digits in its decimal representation so that the resulting number will be divisible by 7.

Number *a* doesn't contain any leading zeroes and contains digits 1, 6, 8, 9 (it also can contain another digits). The resulting number also mustn't contain any leading zeroes.
The first line contains positive integer *a* in the decimal record. It is guaranteed that the record of number *a* contains digits: 1, 6, 8, 9. Number *a* doesn't contain any leading zeroes. The decimal representation of number *a* contains at least 4 and at most 10<sup class="upper-index">6</sup> characters.
# written with help of editorial
from itertools import permutations as pp
from sys import exit

n = input()

z = n.count('0')
n = n.replace('0', '')
a = sorted([n.find('1'), n.find('6'), n.find('8'), n.find('9')])
d = list(map(str, [1, 6, 8, 9]))
n = n[:a[0]] + n[a[0] + 1:a[1]] + n[a[1] + 1:a[2]] + \
            n[a[2] + 1:a[3]] + n[a[3] + 1:]

rr = pow(10, z, 7)
tt = pow(10, z + 4, 7)
try:
    t = int(n) % 7
except:
    t = 0

t *= tt
cnt = [0 for i in range(10000)]
for i in range(10000):
    cnt[i] = (i * rr + t) % 7

for p in pp(d):
    x = p[0] + p[1] + p[2] + p[3]
    if cnt[int(x)] == 0:
        print(n + x + '0' * z)
        exit(0)
        
print(0)
