#ifdef LOCAL111 #define _GLIBCXX_DEBUG #else #define NDEBUG #endif #include const int INF = 1e9; using namespace std; template ostream& operator<< (ostream& os, const pair& p) { cout << '(' << p.first << ' ' << p.second << ')'; return os; } #define endl '\n' #define ALL(a) (a).begin(),(a).end() #define SZ(a) int((a).size()) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #ifdef LOCAL111 #define DEBUG(x) cout<<#x<<": "<<(x)< void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} #else #define DEBUG(x) true template void dpite(T a, T b){ return; } #endif #define F first #define S second #define SNP string::npos #define WRC(hoge) cout << "Case #" << (hoge)+1 << ": " template void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;} template bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;} template bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} typedef long long int LL; typedef unsigned long long ULL; typedef pair P; typedef pair LP; void ios_init(){ //cout.setf(ios::fixed); //cout.precision(12); #ifdef LOCAL111 return; #endif ios::sync_with_stdio(false); cin.tie(0); } template long long gcd(T x, T y){ return y==0 ? x : gcd(y, x%y); } LL sti(string s){ LL res = 0; REP(i,SZ(s)){ res *= 10; res += s[i]-'0'; } return res; } int main() { ios_init(); string s; while(cin >> s){ sort(ALL(s)); if(SZ(s) < 10){ LL g = sti(s); do{ g = gcd(g,sti(s)); }while(next_permutation(ALL(s))); cout << g << endl; }else{ bool f = true; char h = s[0]; REP(i,SZ(s)){ if(h != s[i]){ f = false; } } if(f){ cout << s << endl; continue; } f = true; LL ans = 1; { bool ff = false; REP(i,SZ(s)){ if((s[i]-'0')%2 != 0){ f = false; } if((s[i]-'0')%4 != 0){ ff = false; } } if(ff) ans *= 4; else if(f) ans *= 2; } { LL sum = 0; REP(i,SZ(s)){ sum += s[i]-'0'; } if(sum%9 == 0){ ans *= 9; }else if(sum%3 == 0){ ans *= 3; } } f = true; REP(i,SZ(s)){ if(s[i] != '0' and s[i] != '5'){ f = false; } } if(f) ans *= 5; f = true; cout << ans << endl; } } return 0; }