#include using namespace std; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args&&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; template > using prique = std::priority_queue, U>; template T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) noexcept { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define pb push_back #ifndef LOCAL #define debug(...) #endif void run_case() { string S; cin >> S; sort(rall(S)); while (S.back() == '0') S.pop_back(); vector cnt(10); int N = S.size(); if (S == string(N, S.front())) { cout << S << "\n"; return; } rep(i, N) cnt[S[i] - '0']++; int g = 0; rep(i, 10) if (cnt[i]) rep(j, i + 1, 10) if (cnt[j]) { g = gcd(g, 9 * (j - i)); } vector s; for (ll d = 1; d * d <= g; d++) { if (g % d == 0) { s.pb(d); if (d * d < g) s.pb(g / d); } } int ans = 1; for (int x : s) { ll t = 0; rep(i, N) { t = (t * 10) + S[i] - '0'; t %= x; } if (t == 0) { chmax(ans, x); } } cout << ans << endl; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; // cin >> T; while (T--) run_case(); return 0; }