def tallest(candles):
    candles = sorted(candles, reverse=True)
    counter = 1
    while True:
        if counter >= len(candles):
            print counter 
            break
        elif candles[0]==candles[counter]:
                counter+=1
        else:
            print counter
            break

            
            

n = int(raw_input())
arr = map(int,raw_input().strip().split())
tallest(arr)