#include <cstdio>
#include <algorithm>

using namespace std;

int a[5006];

int main()
{
    freopen ( "pooh.in", "r", stdin );
	freopen ( "pooh.out", "w", stdout );
	
    int n,i,begin,maxSUM=0,minbr,sum;
    scanf ("%d",&n);
    for ( i=1; i<=n; i++ ) scanf("%d",&a[i]);
    sort (a+1,a+n+1);
    
    a[n+1] = 1000007;
    begin = 1;
    
    for ( i=1; i<=n; i++ )
        if ( a[i] != a[i+1] )
        {
            sum = a[i]*(i-begin+1);
            if ( sum > maxSUM || ( sum == maxSUM && minbr > i-begin+1 ) )
            {
                maxSUM = sum;
                minbr = i-begin+1;
            }
            begin = i+1;
        }
    
    printf ("%d\n",maxSUM/minbr);
}<!-- 0.0412s -->