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.
import sys
from math import *
from fractions import gcd
readints=lambda:map(int, input().strip('\n').split())

n=input().strip('\n')

from itertools import permutations
perms = [''.join(p) for p in permutations('1689')]
mod={}
for p in perms:
    p=int(p)
    mod[p%7]=p


freq=[0]*10
for d in n:
    d=int(d)
    freq[d]+=1

    
for d in (1,6,8,9):
    freq[d]-=1

m=0
for d in freq:
    for _ in range(freq[d]):
        m=(10*m + d)%7

ans=''
for p in perms:
    cur=int(str(m)+str(p))
    if cur%7==0:
        ans=str(cur)

for _ in range(freq[0]):
    ans += '0'

print(ans)
    
