#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << x << endl
#define int ll

signed main(){
    string s;
    while(cin >> s){
        int n = s.size();
        if(count(all(s), s[0]) == n){
            cout << s << endl;
        } else if(s.size() <= 12){
            sort(all(s));
            ll g = 0;
            do {
                g = __gcd(g, stoll(s));
            } while(next_permutation(all(s)));
            cout << g << endl;
        } else {
            int sum = 0;
            int g = 0;
            rep(i,n){
                int x = s[i] - '0';
                g = __gcd(g, x);
                sum += x;
            }
            rep(i,n){
                s[i] = (s[i] - '0') / g + '0';
            }
            sum /= g;
            if(sum%9 == 0) g *= 9;
            else if(sum%3 == 0) g *= 3;
            else g *= 1;
            cout << g << endl;
        }
    }
}