#include <bits/stdc++.h>
using namespace std;
long long int bigm(long long int a, long long int b) {
  if (b == 0) return 1;
  if (b % 2) return (a * bigm(a, b - 1)) % 1000000007;
  long long int c = bigm(a, b / 2);
  return (c * c) % 1000000007;
}
class FenwickTree {
 private:
  vector<long long int> ft;

 public:
  FenwickTree() {}
  FenwickTree(int n) { ft.assign(n + 1, 0); }
  long long int rsq(int b) {
    long long int sum = 0;
    for (; b; b -= (b & (-b))) sum = (sum + ft[b]) % 1000000007;
    return sum;
  }
  long long int rsq(int a, int b) {
    if (a > b) return 0;
    return (rsq(b) + 1000000007 - (a == 1 ? 0 : rsq(a - 1))) % 1000000007;
  }
  void adjust(int k, int v) {
    for (; k < (int)ft.size(); k += (k & (-k)))
      ft[k] = (ft[k] + v) % 1000000007;
  }
};
int main() {
  FenwickTree ft(1001000);
  FenwickTree ft2(1001000);
  FenwickTree ft3(1001000);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int a;
    scanf("%d", &a);
    long long int x = ft2.rsq(a, a);
    long long int y = ft3.rsq(a, a);
    long long int z = (ft.rsq(1, a - 1) + 1) % 1000000007;
    long long int p = ft.rsq(a, a);
    long long int temp =
        (((((p + z) - (x + y)) * a) % 1000000007) + 1000000007) % 1000000007;
    ft.adjust(a, temp);
    ft2.adjust(a, ((z - x) % 1000000007 + 1000000007) % 1000000007);
    ft3.adjust(a, ((p - y) % 1000000007 + 1000000007) % 1000000007);
  }
  long long int ans = 0;
  for (int i = 1; i <= 1000000; i++) ans = (ans + ft.rsq(i, i)) % 1000000007;
  cout << ans << endl;
  return 0;
}
