#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <algorithm>
#include <functional>
#include <limits.h>
#include <bitset>

#include <tuple>
#include <unordered_map>

#define mp       make_pair
#define mt       make_tuple
#define pb       push_back
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
const int MAX_L = 5000010;
int N;
vector<int> digit;
vector<int> prime;
bool is_prime[MAX_L];
bool ok[11];
void sieve(){
  is_prime[0] = is_prime[1] = false;
  for (ll i = 2; i * i < MAX_L; i++){
    if (is_prime[i]){
      for (ll j = i + i; j  < MAX_L; j += i){
	is_prime[j] = false;
      }
    }
  }
  for (int i = 2; i <= 5000000; i++){
    if (is_prime[i]){
      prime.push_back(i);
    }
  }
}

bool in_digit(int x, int mm, int &ma){
  while (x){
    int y = x % 10;
    ma |= 1 << y;
    if ((mm & (1 << y)) == 0)return false;
    x /= 10;
  }
  return true;
}
int main(){
  cin >> N;
  digit.resize(N);
  memset(is_prime, true, sizeof(is_prime));
  int mm = 0;
  for (int i = 0; i < N; i++){
    int x;
    cin >> x;
    mm |= 1 << x;
  }
  sieve();
  int K = 1;
  int L = 1;
  memset(ok, false, sizeof(ok));
  int ans = -1;
  int ma = 0;
  for (int i = 0; i < prime.size(); i++){
    if (in_digit(prime[i], mm, ma)){
    }else{
      K = prime[i] + 1;
      L = prime[i] + 1;
      memset(ok, false, sizeof(ok));
      ma = 0;
    }
    if (ma == mm){
      if (i + 1 < prime.size()){
	L = prime[i + 1] - 1;
      }else{
	L = 5000000;
      }
      if (ans < L - K){
	ans = L - K;
      }
    }

  }
  cout << ans << endl;
  return 0;
}