MOD = 10**9 + 7

n = int(input())
a = list(map(int, input().split()))

if n == 0:
    print(0)
else:
    prev_sum_split = 0
    prev_product_split = 0
    prev_sum_not_split = 0
    prev_product_not_split = a[0] % MOD

    for i in range(1, n):
        current = a[i] % MOD

        new_sum_split = (prev_sum_not_split + prev_product_not_split) % MOD
        new_product_split = current

        new_sum_not_split = prev_sum_not_split
        new_product_not_split = (prev_product_not_split * current) % MOD

        # Update for next iteration
        prev_sum_split, prev_product_split = new_sum_split, new_product_split
        prev_sum_not_split, prev_product_not_split = new_sum_not_split, new_product_not_split

    option1 = (prev_sum_split + prev_product_split) % MOD
    option2 = (prev_sum_not_split + prev_product_not_split) % MOD

    final = max(option1, option2)
    print(final)