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]))
    
    if N == 0:
        print(0)
        return
    if N == 1:
        print(A[0] % MOD)
        return
    
    prev_plus_sum = A[0]
    prev_plus_prod = A[0]
    prev_mul_sum = A[0]
    prev_mul_prod = A[0]
    
    for i in range(1, N):
        a = A[i]
        # Compute new_plus
        new_plus_sum = max(prev_plus_sum + a, prev_mul_sum + a)
        new_plus_prod = a
        
        # Compute options for new_mul
        option1_sum = (prev_plus_sum - prev_plus_prod) + prev_plus_prod * a
        option1_prod = prev_plus_prod * a
        option2_sum = (prev_mul_sum - prev_mul_prod) + prev_mul_prod * a
        option2_prod = prev_mul_prod * a
        
        if option1_sum > option2_sum:
            new_mul_sum = option1_sum
            new_mul_prod = option1_prod
        else:
            new_mul_sum = option2_sum
            new_mul_prod = option2_prod
        
        # Update for next iteration
        prev_plus_sum, prev_plus_prod = new_plus_sum, new_plus_prod
        prev_mul_sum, prev_mul_prod = new_mul_sum, new_mul_prod
    
    result = max(prev_plus_sum, prev_mul_sum) % MOD
    print(result)

if __name__ == '__main__':
    main()