asd

import java.io.*;
import java.util.*;

public class Solution {
    public static int mod = 1000000007;
    public static void main(String[] args) {
        Scanner in = new Scanner (System.in);
        int n = in.nextInt();
        long[] arr = new long[n];
        for (int i = 0; i < n; i++) arr[i] = in.nextInt();
        long[] p1 = new long[n], p2 = new long[n];
        p1[0] = arr[0]+1;
        for (int i = 1; i < n; i++) p1[i] = p1[i-1] * (arr[i]+1) % mod;
        p2[n-1] = arr[n-1]+1;
        for (int i = n-2; i >= 0; i--) p2[i] = p2[i+1] * (arr[i]+1) % mod;
        long ans = 0;
        for (int i = 0; i < n; i++) {
            long add = arr[i];
            if (i > 0) add = add * p1[i-1] % mod;
            if (i+1 < n) add = add * p2[i+1] % mod;
            ans = (ans + add) % mod;
        }
        System.out.println(ans);
    }
}