#include <iostream>
#include <vector>
using namespace std;

int n,maxn,a[101];
bool k[100005];
void oushai(){
	vector <int> tprime;
	for (int i = 2;i < maxn;i++){
		if (t)
			 
	}
	return;
}
int main(){
	cin >> n;
	for (int i = 1;i <= n;i++){
		cin >> a[i];
		if (a[i] > maxn)maxn = a[i];
	}
	oushai();
	return 0;
}