#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max<R>(x,0.0));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

// Problem Specific Parameter:

string solve(string s){
	bool same=true;
	const int n=s.size();
	rep(i,n) if(s[0]!=s[i]) same=false;
	if(same) return s;

	int cur=0;
	vector<int> used(10,0);
	rep(i,n) used[s[i]-'0']++;	
	rep(j,10)rep(i,j) if(used[i] and used[j]) cur=__gcd(cur,9*abs(i-j));
	
	int ans=1;
	for(int mod=1;mod<=cur;++mod){
		if(cur%mod) continue;
		int sum=0;
		rep(i,n) sum=(10*sum+(s[i]-'0'))%mod;
		if(sum==0) ans=mod;
	}

	return to_string(ans);
}

string solve2(string s){
	const int n=s.size();
	sort(begin(s),end(s));

	int cur=0;
	do{
		int tar=stoi(s);
		cur=__gcd(cur,tar);
	}while(next_permutation(begin(s),end(s)));
	return to_string(cur);
}


int main(void){
	string s;
	cin >> s;
	cout << solve(s) << endl;
	
	/*
	rep(i,1,10000000){
		string s=to_string(i);
		if(solve(s)!=solve2(s)) 
			cout << "NG: " << s << " " << solve(s) << " " << solve2(s) << endl;
		//else
		//	cout << "OK: " << s << endl;
	}
	*/
	
	return 0;
}