#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100000 + 10;
const int mod = 1e9 + 7;
int n,a[N],ans;
int maxn,Tr[N * 10];
bool vis[N * 10];
int opt[N];
int read(){
	char ch; int sum = 0,flag = 1;
	ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') flag = -flag; ch = getchar();}
	while(ch >= '0' && ch <= '9'){sum = sum * 10 + ch - '0'; ch = getchar();}
	return sum * flag;
}
int query(int x){
	int sum = 0;
	while(x){
		sum = (sum + Tr[x]) % mod;
		x = x - (x & (-x));
	}
	return sum;
}
int Ask(int lft,int rgt){
	return (query(rgt) % mod + mod - query(lft - 1) % mod) % mod;
}
void Add(int x,int val){
	while(x <= maxn){
		if(val < 0)
		Tr[x] = (Tr[x] % mod - ((-val) % mod) + mod) % mod;
		else Tr[x] = (Tr[x] % mod + val % mod) % mod;
		x = x + (x & (-x));
	}
	return ;
}
signed main(){
	n = read();
	for(int i = 1; i <= n; i++){
		a[i] = read();
		maxn = max(maxn,a[i]);
	}
	for(int i = 1; i <= n; i++) opt[i] = a[i];
	for(int i = 1; i <= n; i++){
		int val = Ask(1,a[i]);
		opt[i] = (opt[i] % mod + val * a[i] % mod) % mod;
		Add(a[i],-Ask(a[i],a[i]));
		Add(a[i],opt[i]);
	}
	memset(vis,0,sizeof(vis));
	for(int i = n; i >= 1; i--){
		if(!vis[a[i]]) ans = (ans + opt[i]) % mod;
		vis[a[i]] = 1;
	}
	printf("%lld\n",ans % mod);
	return 0;
}