#include<iostream.h>
int n, sir[105], i;
void read(int *sir, int &n) {
 int i;
 cin >> n;
for (i = 1; i <= n; ++i)
 cin >> sir[i];
 }
 int suma_pare(int *sir, int n) {
int s = 0;
 int i;
 for (i = 1; i <= n; ++i)
	 if (sir[i] % 2 == 0)
 s = s + sir[i];
 return s;
}
 int suma_pare(int *sir, int n) {
 int s = 0;
int i;
 for (i = 1; i <= n; ++i)
 if (sir[i] % 2 == 0)
s = s + sir[i];
 return s;
 }
 int este_prim(int x) {
int i;
for (i = 2; i * i <= x; ++i)
if (x % i == 0)
return 0;
return 1;
 }
void ordoneaza(int *sir, int n) {
 int i, j;
 for (i = 1; i < n; ++i)
for: ++j)*
if (a[i] > a[j])
{
int aux = a[i];
a[i] = a[j];
 a[j] = aux;
 }
 }
 int main() {
read(sir, n);
cout << suma_pare(sir, n) <<endl;
int prime = 0;
 for (i = 1; i <= n; ++i)
if (este_prim(sir[i]) == 1)
++prime;
 cout << prime << endl;
  ordoneaza(sir, n);
for (i = 1; i <= n; ++i)
cout << sir[i] << " ";
cout << endl;
return 0;
 }