#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};


template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

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

void solve() {
  string s; cin >> s;
  int n = (int)s.size();

  for (char c : s) if (c != s[0]) goto NORMAL;
  cout << s << endl;
  return;

NORMAL:

  vector<char> exists(10);
  for (char c : s) exists[c - '0'] = 1;
  int g = 0;
  for (int i : range(10)) if (exists[i])
  for (int j : range(i)) if (exists[j]) {
    g = gcd(g, abs(i - j));
  }
  dump(9 * g);

  auto takemod = [&](int mod) -> int {
    int r = 0;
    for (int i = n - 1; i >= 0; --i) {
      r *= 10;
      r += s[i] - '0';
      r %= mod;
    }
    return r;
  };

  int res = 1;
  vector<int> cand = {3, 9, 27, 81, 2, 4, 8, 5, 7};
  for (int mod : cand) {
    if ((9 * g) % mod == 0 && takemod(mod) == 0) res = lcm(res, mod);
  }
  cout << res << endl;
}

int main() {
  cout << fixed << setprecision(12);
  solve();
}