#include<fstream>
#include<algorithm>
using namespace std;
int a[1000001],x ,element,n,maxim;
ifstream cin ("elmaj.in");
ofstream cout("elmaj.out");

int main()
{
    cin>>n;
    for(int i = 1; i<=n; i++)
        cin>>a[i];

    sort(a+1,a+n+1);

    int L = 1;
    for(int i = 1; i < n; i++)
    {
        if(a[i] == a[i+1])
        {
            L++;
            if(L > maxim)
            {
                maxim = L;
                element = a[i];
            }
        }
        else
            L = 1;

    }
    if(maxim > n/2)
        cout<<element<<" "<<maxim;
    else
        cout<<"NU";
}