#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010;
int cnt[111],n;
char s[N],t[N];
void dfs(int x,int v) {
	if (x==n) {
		if (v==0) {
			puts(t);
			exit(0);
		}
	} else {
		per(i,0,10) if (cnt[i]) {
			if (cnt[i+7]) continue;
			cnt[i]--;
			t[x]='0'+i;
			dfs(x+1,(v*10+i)%7);
			cnt[i]++;
		}
	}
}
int main() {
	scanf("%s",s);
	n=strlen(s);
	rep(i,0,n) {
		cnt[s[i]-'0']++;
	}
	dfs(0,0);
	puts("-1");
}