#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

long long gcd(long long a, long long b) {
    if(a < b) swap(a, b);
    long long ret = 1;
    while(b) {ret = b; b = a % b; a = ret;}
    return ret;
}

vector<int> sieve_of_eratosthenes(int n) {
    vector<bool> is(n + 1, true);
    vector<int> res;
    is[0] = false;
    is[1] = false;
    for (int i = 2; i <= n; i++) if (is[i]) {
        res.emplace_back(i);
        for (int j = i * 2; j <= n; j += i) {
            is[j] = false;
        }
    }
    return res;
}

int main(void) {
    string N;
    cin >> N;
    if (count(ALL(N), N.front()) == N.size()) {
        cout << N << endl;
        return 0;
    }
    VI vbuf = sieve_of_eratosthenes(1110);
    set<int> primes(ALL(vbuf));
    map<int, int> cnt;
    FORE(e, N) cnt[e - '0']++;
    VI v;
    LL kake = INF;
    FORE(e, cnt) {
        if (e.first == 0) continue;
        if (e.second) v.EB(e.first);
        if (e.first) kake = min<LL>(kake, e.second);
    }
    bool f = false;
    bool f2 = true;
    LL buf;
    do {
        LL n = 0;
        FORE(e, v) {
            n *= 10;
            n += e;
        }
        if (FIND(primes, n % 1000)) {
            f2 = false;
        }
        if (FIND(primes, n % 100)) {
            f2 = false;
        }
        if (FIND(primes, n % 10)) {
            f2 = false;
        }
        if (f) buf = gcd(buf, n);
        else buf = n;
        f = true;
    } while (next_permutation(ALL(v)));
    LL ans = buf * kake;
    if (!f2) ans = 1;
    cout << ans << endl;
}