#include using namespace std; #define int long long //#define uint __int128_t #define pb push_back #define fi first #define se second #define rep(i,s,n) for(int i = s;i=(s);i--) #define all(v) (v).begin(),(v).end() #define chmin(a,b) a=min((a),(b)) #define chmax(a,b) a=max((a),(b)) #define low(a,b) lower_bound(all(a),(b))-(a).begin() #define upp(a,b) upper_bound(all(a),(b))-(a).begin() #define fill(i,n) memset(i,n,sizeof(i)) #define endl '\n' #define IOS() ios_base::sync_with_stdio(0);cin.tie(0) typedef long long ll; typedef pairpint; typedef vectorvint; typedef vector vvint; typedef vectorvpint; typedef pair P1; typedef pair P2; typedef pair PP; static const ll maxLL = (ll)1 << 62; const ll MOD=1000000007; const ll INF=1e18; int N; string s[13]; unordered_mapmp; vector P; void make_primes(int n) { vector primes; primes.resize(n + 1, true); primes[0] = primes[1] = false; rep(i, 2, sqrt(n)) if (primes[i]) for (int j = 0; i * (j + 2) < n; j++) primes[i * (j + 2)] = false; rep(i, 2, n + 1) if (primes[i]) P.push_back(i); } int perm2[13]; void permtation2(int n){ for(int i=0;i>N; rep(i,0,N){ cin>>s[i]; } make_primes(181313131); permtation2(N); std::priority_queuepq; bool ok; for(auto e:mp)pq.push(stol(e.fi)); while(!pq.empty()){ int q=pq.top(); pq.pop(); //cout<