#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int gcd(int a,int b){
	return b?gcd(b,a%b):a;
}

string s;
bool used[11];

int main(){
	cin.sync_with_stdio(false);
	cin>>s;
	int sum=0;
	rep(i,s.length()){
		used[s[i]-'0']=true;
		if(s[i]-'0')sum+=(s[i]-'0');
	}
	int cnt=0;
	rep(i,10){
		if(used[i])cnt++;
	}
	if(cnt==1)cout<<s<<endl;
	else{
		int gcdd=1;
		if((s[0]-'0')%2==0)gcdd*=2;
		if(((s[1]-'0')*10+(s[2]-'0'))%4==0)gcdd*=2;
		if(sum%3==0)gcdd*=3;
		if(sum%9==0)gcdd*=3;
		rep(i,10)repl(j,i+1,10){
			if(used[i]&&used[j]){
				gcdd=gcd(9*(j-i),gcdd);
			}
		}
		cout<<gcdd<<endl;
	}
	return 0;
}