#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int MAX_N = 200000;
int MAX_A = 1000000000;
int main(){
    //想定TLE1 (O(N^3))
    long long N;
    cin >> N;
    assert(N >= 1);
    assert(N <= MAX_N);
    vector<int> A(N);
    for (int i = 0; i < N; i++){
        cin >> A[i];
        assert(A[i] >= 0);
        assert(A[i] <= MAX_A);
    }
    long long ans = 0;
    for (int i = 0; i < N; i++){
        for (int j = i; j < N; j++){
            for (int long k = i; k <= j; k++){
                ans += A[k];
                ans %= MOD;
            }
        }
    }
    cout << ans << endl;
}