#include using namespace std; #define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL) #define pb push_back #define int long long #define ll long long #define ld long double #define rep(i, n) for (ll i=0; i=0; i--) #define mem(v, ha) memset(v, ha, sizeof(v)) #define all(a) a.begin(), a.end() #define allr(a) a.rbegin(), a.rend() #define CLOCK cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; typedef vector vi; typedef vector> vvi; typedef vector> vpi; typedef vector vc; #define no cout << "NO\n" #define yes cout << "YES\n" #define mp make_pair #define ff first #define ss second const ll M = 1e9 + 7; const ll mod = 998244353 ; const long double PI = 3.141592653589793238460; const int inf = (int)(1e9); // auto sum=[&](int use, int y){return use+y;}; void solve() { string s; cin >> s; int g = 0; setse; rep(i, s.size()) se.insert(s[i] - '0'); vi s1; for (auto l : se) s1.pb(l); for (int i = 0; i < s1.size(); i++) { for (int j = 0; j < s1.size(); j++) { if (s1[i] < s1[j]) continue; int k = s1[i] - '0'; int l = s1[j] - '0'; g = __gcd(g, 9 * (k - l)); } } // cout << g; // int k = (stoi)(s); if (g == 0) { cout << s << '\n'; return; } int k = 0; rep(i, s.size()) { k *= 10; k += s[i] - '0'; k %= g; } cout << __gcd(g, k ) << '\n'; } int32_t main() { fast_io; int T = 1; // cin >> T; while (T--) { solve(); } }