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
input = lambda: sys.stdin.readline().rstrip()
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations
from bisect import *
from heapq import *
from math import ceil,gcd,lcm,floor,comb
s = {}

for i in permutations("1689"):
    s[int(''.join(i))%7] = ''.join(i)

S = input()
t = []
k = set("1689")
p = 0
num,ans = 4,0
for i in S:
    if i in k or i=="0":
        if i=="0":
            p+=1
        else:
            k.remove(i)
    else:
        t.append(i)

for i in t[::-1]:
    ans+=pow(10,num,7)*int(i)
    ans%=7
    num+=1

r = ''.join(t)+s[(7-ans)%7]

print(r+"0"*p)

