#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef bitset<16> BS;

const ll MOD = 1E+09 + 7;
const ll INF = 1E15;
const int MAX_N = 1E+05;

string N;
int X[MAX_N];
int gcd(int a, int b);

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N;
    unordered_set<int> s;
    for (auto c : N) {
        if (!s.count(c - '0')) {
            s.insert(c - '0');
        }
    }
    string ans = N;
    int d = 0;
    if (s.size() > 1) {
        for (auto a : s) {
            for (auto b : s) {
                if (a > b) {
                    d = gcd(d, 9 * (a - b));
                }
            }
        }
        ans = "1";
        for (int i = 2; i <= d; i++) {
            if (d % i == 0) {
                int d_r = 1;
                int r = 0;
                for (auto c : N) {
                    r = (r + int(c - '0') * d_r) % i;
                    d_r = (d_r * 10) % i;
                }
                if (r == 0) {
                    ans = to_string(i);
                }
            }
        }
    }

    cout << ans << "\n";

    return 0;
}

int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}