aaa

bool isPrime(int n) {

    if(c == 0) {
        return true;
    }else{
        return false;
    }
}


#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>

using namespace std;

int main()
{
    int sum = 0, x;
    vector<int> v;
    while(cin >> x){
        v.push_back(x);
    }
    for(vector<int>::iterator it = v.begin(); it !=  v.end(); it++){
        int c = 0;
        for(int i = 1; i <= *it; i++) {
            if(*it % i == 0) {
                c++;
            }
        }
        if(c == 2){
            v.erase(it);
            it--;
        }
    }
    vector<int>::iterator mx = max_element(v.begin(), v.end());
    vector<int>::iterator mn = min_element(v.begin(), v.end());
    sum = *mx + *mn;
    for(vector<int>::iterator it = v.begin(); it !=  v.end(); it++){
        cout << *it << " ";
    }
    cout << endl;
    cout << "max = " << *mx << endl <<"min = " << *mn;
    cout << endl;
    cout << "sum = " << sum;

    return 0;
}
//1 2 3 4 55
//1 -2 -5 48 -36 78