TEST

#include <bits/stdc++.h>

using namespace std;
const int maxn = 1001;
int a[maxn],n,dem[maxn];
void nhap()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
}
void find_maxmin()
{
    int maxx=INT_MIN,minn=INT_MAX;
    for(int i=1;i<=n;i++)
    {
        maxx=max(maxx,a[i]);
        minn=min(minn,a[i]);
    }
    cout<<"So lon nhat: "<<maxx<<"\n";
    cout<<"So nho nhat: "<<minn<<"\n";
}
void duplicate()
{
    sort(a+1,a+1+n);
    int id=1,num,tmp=INT_MIN;
    for(int i=1;i<=n;i++)
        if (a[i] != a[i+1])
    {
        int slxh = i - id + 1;
        if (slxh > tmp)
        {
            tmp=slxh;
            num = a[i];
        }
        id = i+1;
    }
    cout<<num<<" xuat hien nhieu nhat";
}
int main()
{
    nhap();
    find_maxmin();
    duplicate();
    return 0;
}