#include <bits/stdc++.h>
using namespace std;
int n, tot = 0;
struct NUM {
  int v, p, r;
} a[100010];
inline bool cmp1(NUM x, NUM y) { return x.v < y.v; }
inline bool cmp2(NUM x, NUM y) { return x.p < y.p; }
int c[100010], b[100010];
inline void add(int x, int d) {
  for (; x <= tot; x += x & -x) c[x] = (c[x] + d) % 1000000007;
}
inline int sum(int x) {
  int ret = 0;
  for (; x > 0; x -= x & -x) ret = (ret + c[x]) % 1000000007;
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i].v);
    a[i].p = i;
  }
  sort(a + 1, a + 1 + n, cmp1);
  a[1].r = ++tot;
  for (int i = 2; i <= n; ++i)
    if (a[i].v == a[i - 1].v)
      a[i].r = tot;
    else
      a[i].r = ++tot;
  sort(a + 1, a + 1 + n, cmp2);
  memset(c, 0, sizeof(c));
  memset(b, 0, sizeof(b));
  for (int i = 1; i <= n; ++i) {
    int f = ((long long)sum(a[i].r) * (long long)a[i].v % 1000000007 + a[i].v) %
            1000000007;
    add(a[i].r, (f - b[a[i].r] + 1000000007) % 1000000007);
    b[a[i].r] = f;
  }
  printf("%d\n", (sum(tot) + 1000000007) % 1000000007);
  return 0;
}
