#include<bits/stdc++.h>
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T>&v){for(auto&i:v)O<<i<<' ';return O;}
namespace AC{
void solve(){
	string s;
	cin>>s;
	int n=s.size();
	sort(all(s));
	if(n<10){
		int ans=0;
		do ans=__gcd(ans,stoll(s));while(next_permutation(all(s)));
		cout<<ans<<endl;
		return;
	}
	if(s.front()==s.back()){
		cout<<s<<endl;
		return;
	}
	if(s[n-2]=='0'){
		cout<<s.back()<<endl;
		return;
	}
	int sum=0,cnt0=0,cnt2=0,cnt4=0,cnt8=0;
	for(auto c:s){
		int x=c-'0';
		sum+=x;
		if(!c)cnt0++;
		if(c&&!c%2)cnt2++;
		if(c&&!c%4)cnt4++;
		if(c&&!c%8)cnt8++;
	}
	int ans=1;
	//2
	if(cnt8&&cnt8+cnt0==n)ans*=8;
	else if(cnt4&&cnt4+cnt0==n)ans*=4;
	else if(cnt2&&cnt2+cnt0==n)ans*=2;
	//3
	if(!sum%9)ans*=9;
	else if(!sum%3)ans*=3;
	cout<<ans<<endl;
}
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--)AC::solve();
}