#include <iostream>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <climits>
#include <vector>
#include <algorithm>
using namespace std;

const int MOD = (int)(1e9 + 7);

bool isPrime(long long n) {
	for (long long i = 2;i * i <= n;i++) {
		if (n % i == 0) {
			return false;
		}
	}
	return n >= 2;
}

int main() {
	int n;cin >> n;
	vector<int> v;
	for (int i = 1;i <= n;i++) {
		int value;cin >> value;
		v.push_back(value);
	}
	int current_length = 0, max_length = 0;
	int current_sum = 0, max_sum = 0;
	int index = -1;

	for (int i = 0;i < n;i++) {
		if (isPrime(v[i])) {
			current_length++;
			current_sum += v[i];
		}
		else {
			current_length = 0;
			current_sum = 0;
		}
		if (current_length > max_length) {
			max_length = current_length;
			max_sum = current_sum;
			index = i - max_length + 1;
		}
		else if (current_length==max_length) {
			if (current_sum > max_sum) {
				max_length = current_length;
				max_sum = current_sum;
				index = i - max_length + 1;
			}
		}
	}

	if (index == -1) {
		cout << "NOT FOUND";
	}
	else {
		cout << max_length << endl;
		for (int i = 0;i < max_length;i++) {
			cout << v[index + i] << " ";
		}
	}
	return 0;
}