#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; namespace { using Integer = long long; //__int128; template istream& operator >> (istream& is, pair& p){return is >> p.first >> p.second;} template istream& operator >> (istream& is, vector& vec){for(T& val: vec) is >> val; return is;} template istream& operator , (istream& is, T& val){ return is >> val;} template ostream& operator << (ostream& os, const pair& p){return os << p.first << " " << p.second;} template ostream& operator << (ostream& os, const vector& vec){for(size_t i=0; i ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template void print(const H& head){ cout << head; } template void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template void println(const T& ... values){ print(values...); cout << endl; } template void eprint(const H& head){ cerr << head; } template void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; inline string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast(chrono::steady_clock::now().time_since_epoch()).count()); template string join(const vector& v, const string& sep){ stringstream ss; for(size_t i=0; i0) ss << sep; ss << v[i]; } return ss.str(); } inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } constexpr long long mod = 9_ten + 7; long long gcd(long long a, long long b){ return (b==0)?a:gcd(b,a%b); } template long long gcd(long long a, long long b, T ... c){ return gcd(gcd(a,b), c...);} long long gcd(vector& g, long long v, int i=0){ if(i==g.size()) return v; return gcd(g, gcd(v,g[i]), i+1); } int main(){ string s; cin >> s; bool even = false; bool odd = false; vector cnt(10, 0); for(auto i : range(10) ){ cnt[i] = count(s.begin(), s.end(), i+'0'); if(i>0 && cnt[i]) (i%2?odd:even) = true; } string t = s; sort(s.begin(), s.end()); s.erase( unique(s.begin(), s.end()), s.end()); if(s.size() == 1){ println(t); return 0; } if(s.size() == 2){ abort(); } long long sum = 0; for(auto i : range(10) ){ sum += i*cnt[i]; } long long ans = 1; for(long long k=3; k<=9; k*=3){ if(sum%k == 0) ans *= 3; } if(even && !odd){ vector v; for(int i=2; i<10; i+=2){ if(cnt[i]){ v.push_back(i); } } if(v.size()) ans *= gcd(v, 8); } for(int i=1; i<10; i++){ if(i!=2 && i!=4 && i!=8) if(cnt[i] + cnt[0] == t.size()){ if(i%3 != 0) ans *= i; if(cnt[i] % 9 == 0) ans *= 3; } } println(ans); return 0; }