#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

// long version
long long int GCD(long long int x, long long int y){
    if(x == 0 && y == 0) return 0;
    if(x>y){
        long long int swap = x;
        x = y;
        y = swap;
    }
    while(true){
        if(y%x==0){
            return x;
        }else{
            long long int amari = y%x;
            y = x;
            x = amari;
        }
    }
}

int main() {
    string s;
    cin >> s;
    int f[10] = {};
    int n = s.size();
    rep(i,n){
        f[s[i]-'0'] = 1;
    }
    int cnt = 0;
    rep(i,10) cnt += f[i];
    if(cnt == 1){
        cout << s << endl;
        return 0;
    }
    int g = 0;
    rep(i,10){
        srep(j,i+1,10){
            if(f[i]&&f[j]){
                if(g == 0){
                    g = (j-i)*9;
                }else{
                    g = GCD(g,(j-i)*9);
                }
            }
        }
    }

    int ans = 1;
    srep(i,2,g+1){
        if(g%i==0){
            int now = 0;
            rep(j,n){
                now *= 10;
                now += s[j] - '0';
                now %= i;
            }
            if(now == 0) ans = i;
        }
    }
    cout << ans << endl;
    return 0;
}