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

# Main function
def find_gcd_permutations_of_digit(given_number):
	"""
	Returns the gcd of all numbers that can be
	obtained by permuting the digits of given_number
	"""
	s = str(given_number)
	perms = permutations(s)
	num_list = []
	for p in perms:
		if p[0] == '0':
			continue
		num_list.append(int(''.join(p)))
	for n in num_list:
		if(n%7==0):
			print(n)
			return
	print(0)
	return

num = int(input())
find_gcd_permutations_of_digit(num)
