#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<vector>

#define ll long long
#define sz(x) int(x.size())
using namespace std;

void Fast_IO(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif
}
 bool is_prime(int n){
     if(n<2||(n %2 ==0 && n!=2)) return false;
     for(int i =3; i<= sqrt(n); i+=2){
         if(n%i==0) return false;
     }
    return true;
 }
int prime_count(vector<int>v, int n){
    int counter =0;
    for(int i =0; i<n; i++){
        if(is_prime(v[i])) counter++;
    }
    return counter;
}
bool is_palindrome(int n){
    string s = to_string(n);
    int i =0, j=sz(s)-1;
    while(i<j){
        if(s[i] != s[j]) return false;
    }
    return true;
}
int count_palindrome(vector<int>v, int n){
    int counter =0;
    for(int i =0; i<n; i++){
        if(is_palindrome(v[i])) counter++;
    }
    return counter;
}
int number_divisors(int n){
    int counter =0;
    for(int i =1; i<sqrt(n); i++){
        if(n%i==0) counter+=2;
    }
    int sq= sqrt(n);
    if(sq*sq==n) counter++;
    return counter;
}
int max_divisor(vector<int>v,int n){
    int max_number = -1, max_divisors = -1;
    for(int i =0; i<n; i++){
        int n_divisors = number_divisors(v[i]);
        if(n_divisors>= max_divisors){
            max_divisors= n_divisors;
            max_number= v[i];
        }

    }
    return max_number;

}



void solve(){

   int n; cin>>n;
   vector<int>v(n);
   for(int i =0; i<n; i++) cin>>v[i];
   sort(v.begin(),v.end());
   cout<<"The maximum number : "<<v[n-1]<<"\n";
   cout<<"The minimum number : "<<v[0]<<"\n";
   cout<<"The number of prime numbers : "<<prime_count(v,n)<<"\n";
   cout<<"The number of palindrome numbers : "<<count_palindrome(v,n)<<"\n";
   cout<<"The number that has the maximum number of divisors : "<<max_divisor(v,n)<<"\n";




}

int main(){
    Fast_IO();
int t =1;
// cin>>t;
while(t--){
solve();
}
return 0;
}