#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
using u64 = uint64_t;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcountll(x); }
inline ll floor_div(ll a, ll b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
inline ll ceil_div(ll a, ll b) noexcept { return floor_div(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
template <class T> void dedup(std::vector<T>& v) { std::sort(std::begin(v), std::end(v)), v.erase(std::unique(std::begin(v), std::end(v)), std::end(v)); }
template <class F> ll bisect(ll ok, ll ng, const F& f) { while (abs(ok - ng) > 1) { ll mid = (ok + ng) / 2; (f(mid) ? ok : ng) = mid; } return ok; }
template <class F> ld bisect_real(ld ok, ld ng, const F& f, int iter = 80) { while (iter--) { ld mid = (ok + ng) / 2.; (f(mid) ? ok : ng) = mid; } return ok; }
inline void SCAN() {}
template <class H, class... T> inline void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); }
#define INT(...) int __VA_ARGS__; SCAN(__VA_ARGS__)
#define LL(...) long long __VA_ARGS__; SCAN(__VA_ARGS__)
#define LD(...) long double __VA_ARGS__; SCAN(__VA_ARGS__)
#define STR(...) std::string __VA_ARGS__; SCAN(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; SCAN(__VA_ARGS__)
#define VEC(type, name, size) std::vector<type> name(size); for (int i = 0; i < (int)size; i++) SCAN(name[i]);
#define VV(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w)); for (int i = 0; i < (int)h; i++) for (int j = 0; j < (int)w; j++) SCAN(name[i][j]);
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define len(x) (long long)(size(x))
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

#include <atcoder/segtree>
#include <atcoder/modint>
using mint = atcoder::modint998244353;
using S = array<int, 10>;
S op(S a, S b) {
    rep(i, 10) a[i] += b[i];
    return a;
}
S e() { return S{}; }
void run_case() {
    INT(N);
    VEC(int, A, N);
    if (N == 10) {
        cout << 4999999 << "\n";
        return;
    }
    int mask = 0;
    rep(i, N) mask |= 1 << A[i];
    vector<int> ps;
    const int maxn = 5000000;
    vector<int> isp(maxn, 1);
    rep(x, 2, maxn) if (isp[x]) rep(y, x + x, maxn, x) isp[y] = 0;
    rep(x, 2, maxn) if (isp[x]) ps.push_back(x);
    ps.insert(ps.begin(), 0);
    vector<S> init(len(ps));
    rep(i, len(ps)) {
        int x = ps[i];
        S t{};
        while (x) {
            t[x % 10] += 1;
            x /= 10;
        }
        init[i] = t;
    }
    atcoder::segtree<S, op, e> seg(init);
    int ans = -1;
    rep(i, 1, len(ps)) {
        auto f = [&](S x) {
            int cur = 0;
            rep(i, 10) if (x[i]) cur |= 1 << i;
            return (mask & cur) == cur;
        };
        int j = seg.max_right(i, f);
        S t = seg.prod(i, j);
        int cur = 0;
        rep(j, 10) if (t[j]) cur |= 1 << j;
        if (mask == cur) {
            j = min(j, (int)ps.size() - 1);
            ans = max(ans, ps[j] - ps[i - 1] - 2);
        }
    }
    cout << ans << "\n";
}
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    while (T--) run_case();
    return 0;
}