#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

int main()
{
    string s;
    cin >>s;

    int ct[10]={0};
    int not_zero=0;
    int sum=0;
    rep(i,s.size())
    {
        sum+=s[i]-'0';
        ++ct[s[i]-'0'];
        if(s[i]!='0') ++not_zero;
    }

    int k=0;
    rep(i,10) if(ct[i]>0) ++k;
    if(k==1)
    {
        cout << s << endl;
        return 0;
    }

    int t=1;
    if(sum%9==0) t=9;
    else if(sum%3==0) t=3;

    int a[3]={8,4,2};
    rep(i,3)
    {
        bool ok=true;
        rep(j,s.size()) if((s[j]-'0')%a[i]!=0) ok=false;
        if(ok)
        {
            t*=a[i];
            break;
        }
    }

    bool ok=true;
    rep(i,s.size()) if((s[i]-'0')%5!=0) ok=false;
    if(ok) t*=5;

    cout << t << endl;
    return 0;
}