import heapq

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    A = list(map(int, input[1:N+1]))
    
    if N == 1:
        print(A[0])
        return
    
    heap = []
    for num in A:
        heapq.heappush(heap, -num)
    
    for i in range(N-1):
        if i % 2 == 0:  # Alice's turn
            a = -heapq.heappop(heap)
            b = -heapq.heappop(heap)
            heapq.heappush(heap, -(a * b))
        else:  # Bob's turn
            a = -heapq.heappop(heap)
            b = -heapq.heappop(heap)
            heapq.heappush(heap, -1)
    
    print(-heap[0])

if __name__ == "__main__":
    main()