#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;

ll N, K, W, H, M, C, V;

const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

vector<double> cx, cy, c;
 ll MM = 1e12;

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

std::vector<int> Eratosthenes(int n ){
    std::vector<bool> is_prime( n + 1 );
    for( int i = 0; i <= n; i++ ) is_prime[ i ] = true;
    std::vector<int> P;
    for( int i = 2; i <= n; i++ ){
        if( is_prime[ i ] ){
            for( int j = 2 * i; j <= n; j += i ){
                is_prime[ j ] = false;
            }
            P.emplace_back( i );
        }
    }
    return P;
}

int main(){
    cin >> N;
    vector<int> digits(10, 0);
    REP(i,N) {int d; cin >> d; digits[d] = 1;}
    vector<int> p = Eratosthenes(5000001);
    int ans = -1;
    int left = 0;
    vector<int> num(10, 0);
    REP(right, p.size()){
        for(auto u: to_string(p[right])) num[u- '0'] += 1;
        REP(i, 10){
            if(digits[i]) continue;
            while(num[i] > 0){
                for(auto u: to_string(p[left])) num[u- '0'] -= 1;
                ++left;
            }
        }
        bool flag = true;
        REP(i, 10){
            if(!digits[i]) continue;
            if(num[i] == 0) flag = false;
        }
        if(right >= left and flag){
            int K = left == 0 ? 1: p[left -1] + 1;
            int L = right ==(int)p.size() -1 ? 5000000: p[right+1] -1;
            ans = max(ans, L-K);
        }
    }
    cout << ans ;
    return 0;
}