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


x=set([1,6,8,9])

z=0
cur=''
for d in n:
    d=int(d)
    if d==0:
        z+=1
    elif d in x:
        x.remove(d)
    else:
        cur+=str(d)


def long_div(x):
    rm=0
    for d in x:
        y=rm*10+int(d)
        rm=y%7
    return rm


for w in mod.values():
    x = cur+str(w)
    if long_div(x)==0:
        for _ in range(z):
            x += '0'
        print(x)
        sys.exit(0)
