n = int(input())
a = list(map(int,input().split()))
a.sort()
if n == 1:
    print(a[0])
elif n == 2:
    print(a[0]*a[1])
elif n & 1:
    print(1)
else:
    import heapq
    x,y = heapq.heappop(a),heapq.heappop(a)
    heapq.heappush(a,x*y)
    for i in range(n//2-1):
        x = heapq.heappop(a)
        heapq.heappush(a,x)
    print(x)