#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return (int)p;}

const int iinf = 1e9;
const ll linf = 4e18;
const int mod = 1e9+7;
const double eps = 1e-10;

string s;
int c[10], a;
bool c5, c2, c4;
ll su, g=1, d;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> s;
  if(sz(s) == 1){
    cout << s << endl;
    return 0;
  }
  FOR(i, 0, sz(s)){
    d = s[i] - '0';
    su += d;
    if(d % 4!=0) c4 = true;
    if(d % 2!=0) c2 = true;
    if(d % 5!=0) c5 = true;
    c[d]++;
  }
  int zc = 0;
  FOR(i, 0, 10)if(c[i]==0)zc++;
  if(zc==9){
    cout << s << endl;
    return 0;
  }
  if(su % 9==0){
    g *= 9;
  }else if(su%3==0){
    g *= 3;
  }
  if(!c4){
    g*= 4;
  }else if(!c2){
    g*=2;
  }else if(!c5){
    g *= 5;
  }
  cout << g << endl;
  return 0;
}