#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

char s[125252];
int cnt[102];
int buf[125252];

int mymod(int n,int m){
  int r = 0;
  REP(i,n){
    r = r*10%m;
    r = (r+buf[i])%m;
  }
  return r;
}

int main(){
  scanf("%s",s);
  int n = strlen(s);
  REP(i,10)cnt[i] = count(s,s+n,'0'+i);
  REP(i,10)if(cnt[i]==n){
    puts(s);
    return 0;
  }
  int x = 0;
  REP(i,10)REP(j,i){
    // j < i
    if(cnt[i]==0 || cnt[j]==0)continue;
    int knt[12];
    REP(k,10)knt[k]=cnt[k];
    int m = 9*(i-j);
    knt[i]--;knt[j]--;
    int it = 0;
    REP(k,n-2){
      while(knt[it]==0)it++;
      knt[it]--;
      buf[k] = it;
    }
    buf[n-2] = j;
    buf[n-1] = i;
    int gg = mymod(n,m);
    int g = __gcd(gg,m);
    x = __gcd(x,g);
  }
  printf("%d\n",x);
  return 0;
}