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