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 itertools
mods={}
perm=itertools.permutations(['1','8','6','9'])
for e in perm:
    
    num=int("".join(e))
    if num%7 not in mods:
        mods[num%7]=e 
def main(n):
    if len(n)==4:
       
        return int("".join(mods[0]))
    n.remove('1')
    
    n.remove('8')
    n.remove('6')
    n.remove('9') 
    n.sort(reverse=True)
    
    num=int(""  .join(n)) 
    num*=10**4
    val=7-num%7 
    if val==7:
        val=0
    if num==0:
        n=list(mods[val])+n 
    else:  
        n+=mods[val]
    
    return int("".join(n))
   
n=[c for c in input()]
print(main(n))
    
   