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.
from itertools import permutations
p = permutations('1689')

n = input()
f = [0]*10
for i in n:
    f[ord(i) - ord('0')] += 1

f[1] -= 1
f[6] -= 1
f[8] -= 1
f[9] -= 1

mod = 0
for i in range(1, 10):
    while f[i]:
        print(i, end='')
        f[i] -= 1
        mod = mod * 10 + i
        mod %= 7

for x in p:
    mod2 = int(''.join(x))
    if mod + mod2 % 7 == 0:
        print(mod2, end='0'*f[0])
        break