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.
#include<bits/stdc++.h>
using namespace std;
string mmn;
int tre,sum;
 
int main(){
	cin >> mmn;
	while(true){
		tre = 0;
		for(int i = 0;i < mmn.size();i++){
			tre *= 10;
			tre += (mmn[i]-48);
			tre %= 7;
		}
		if(tre == 0){
			cout << mmn;
			return 0;
		}
		next_permutation(mn.begin(),mn.end());
	}
}
			 	 		 			  			 	 		 	 	 				