#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 este_prim(int x) {
     int i;
     for (i = 2; i * i <= x; ++i)
         if (x % i == 0)
             return 0;
     return 1;
      }
int oglindit(int x) {
    int a = 0;
    while (x > 0) {
        a = a * 10 + x % 10;
        x /= 10;
    }
    return a;
}
void ordoneaza(int *sir, int n) {
     int i, j;
      for (i = 1; i < n; ++i)
          for (j = i + 1; j <= n; ++j)
              if (sir[i] > sir[j])
              {
                  int aux = sir[i];
                  sir[i] = sir[j];
                   sir[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;

    for (i = 1; i <= n; ++i)
        if (sir[i] % 2 == 1)
            cout << oglindit(sir[i]) << " ";
    cout << endl;
         ordoneaza(sir, n);
         for (i = 1; i <= n; ++i)
             cout << sir[i] << " ";
         cout << endl;
         return 0;
          }