[백준] 2217 로프

n=int(input())

ropes=[]
for i in range(n):
    ropes.append(int(input()))

ropes.sort(reverse=True)
now=0
total=0
for i in range(n):
    now=ropes[i]*(i+1)
    total=max(now,total)

print(total)