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

#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
}

int max(int arr[],int n){
int max = arr[0];
for(int i =0; i<n;i++){
    if(arr[i]>max)
    max =arr[i];
}
return max;
}
int min(int arr[],int n){
int min = arr[0];
for(int i =0; i<n;i++){
    if(arr[i]<min)
    min =arr[i];
}
return min;
}
int palindrome(int arr[], int n){
    int counter =0;
    for(int i =0;i<n; i++){
        ll temp = arr[i];
        ll rev =0;
        while(temp!=0){
        int rem=temp%10;
        rev=rev*10+rem;
        temp/=10;
        }
        if(rev == arr[i]) counter++;
    }
    return counter;
}
bool isprime(int n){
    if(n == 2) return true;
    if(n==1) return false;
for(int i =2; i<=sqrt(n); i++){
if(n%i==0) return false;
}
return true;


}
int countdivisor(int n){
    int countdivisor =0;
for(int i = 0; i<n; i++){
    if(n%i==0) countdivisor++;
}
return countdivisor;
}






int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){

int n, primecount =0; cin>>n;

int arr[n];
for(int i =0; i<n;i++) cin>>arr[i];

cout<<"The maximum number : "<<max(arr,n)<<"\n";
cout<<"The minimum number : "<<min(arr,n)<<"\n";
for(int i =0; i<n; i++){
if(isprime(arr[i])) primecount++;
}
cout<<"The number of prime numbers : "<<primecount<<"\n";
cout<<"The number of palindrome numbers : "<<palindrome(arr,n)<<"\n";
int maxdiv,index,num;
for(int i =0; i<n; i++){
    num = countdivisor(arr[i]);
    if(i==0){
        maxdiv = num;
        index = i;
    }else if(num>=maxdiv){
        maxdiv = num;
        index = i;
    }
}



cout<<"The number that has the maximum number of divisors : "<<arr[index];



}
return 0;
}