MOD = 10**9 + 7

def main():
    import sys
    input = sys.stdin.read().split()
    n = int(input[0])
    A = list(map(int, input[1:n+1]))
    
    # Precompute sum_right for the power product
    sum_right = [0] * n
    current_sum = 0
    for i in range(n-2, -1, -1):
        current_sum += A[i+1]
        sum_right[i] = current_sum
    
    # Compute power product
    power_prod = 1
    for i in range(n):
        a = A[i]
        exponent = sum_right[i]
        if exponent == 0:
            continue
        power_prod = (power_prod * pow(a, exponent, MOD)) % MOD
    
    # Compute sum product (this part is not feasible for large n, placeholder for correct approach)
    sum_prod = 1
    for i in range(n):
        for j in range(i+1, n):
            sum_prod = (sum_prod * (A[i] + A[j])) % MOD
    
    # Find min_val (simplified for example)
    min_val = float('inf')
    for i in range(n):
        for j in range(i+1, n):
            current = (A[i] + A[j]) * pow(A[i], A[j], MOD * (A[i] + A[j]))
            if current < min_val:
                min_val = current
    
    # Compute result
    denominator = min_val % MOD
    numerator = (sum_prod * power_prod) % MOD
    result = (numerator * pow(denominator, MOD-2, MOD)) % MOD
    print(result)

if __name__ == '__main__':
    main()