// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <unordered_map>
//#include <complex>
//#include <deque>
#include <valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>

// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;

// output
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}

// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

// test
template<class T> std::vector<std::vector<T>> VV(int n) {
	return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
	return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const

#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

namespace oldalgo {
	int calcParallelogram(int w, int h) {
		return w * h % MOD;
	}
	int calcParallelogramEX(int w, int h) {
		return w * h * (w + h) / 2 % MOD;
	}

	int extra(const std::vector<int>& a) { // O(n^2) yet
		int n = a.size();
		int res = 0;
		int max = 0, max_i = 0;

		auto ml(a);
		auto mr(a);
		REP(i, n - 1) CHMAX(ml[i + 1], ml[i]);
		RREP(i, n - 1) CHMAX(mr[i], mr[i + 1]);
		std::reverse(ALL(mr));
		REP(i, n) {
			if (max < a[i]) {
				max = a[i];
				max_i = i;
			}
		}
		REP(i, n) {
			ml[i] = max - ml[i];
			mr[i] = max - mr[i];
		}

		REP(i, max_i) REP(j, n - max_i - 1) {
			res += std::min(i, j + 1) * std::min(ml[i], mr[j]);
		}
		return res;
	}

	int calc(const std::vector<int>& a) {
		int n = a.size();
		int res = 0;
		std::map<int, std::vector<int>> map;
		int max = 0;
		REP(i, n) {
			map[a[i]].emplace_back(i);
			CHMAX(max, a[i]);
		}

		REP(i, n + 1) { // top parallelogram
			(res += max * calcParallelogram(i, (i - 1) * i / 2 % MOD)) %= MOD;
		}

		std::set<PAIR> set;
		set.insert(PAIR(INFINT, INFINT));
		set.insert(PAIR(0, n));

		for (auto mit = map.rbegin(); mit != map.rend(); ++mit) {
			const int& x = mit->first;
			const auto& v(mit->second);
			for (auto& vi : v) {
				auto it = std::prev(set.lower_bound(PAIR(vi, INFINT)));
				int tl = it->first, tr = it->second;
				(res += x * calcParallelogramEX(vi - tl + 1, tr - vi)) %= MOD;

				set.erase(it);
				if (tl < vi) set.insert(PAIR(tl, vi));
				if (vi + 1 < tr) set.insert(PAIR(vi + 1, tr));
			}
		}

		res -= extra(a);

		res %= MOD;
		if (res < 0) res += MOD;
		return res;
	}
};

namespace newalgo {
	int calcParallelogram(int w, int h) {
		return w * h % MOD;
	}
	int calcParallelogramEX(int w, int h) {
		return w * h * (w + h) / 2 % MOD;
	}

	int extra(const std::vector<int>& a) { // O(nlogn)
		int n = a.size();
		int res = 0;
		int max = 0, max_i = 0;

		auto ml(a), mr(a);
		REP(i, n - 1) CHMAX(ml[i + 1], ml[i]);
		RREP(i, n - 1) CHMAX(mr[i], mr[i + 1]);
		std::reverse(ALL(mr));
		REP(i, n) {
			if (max < a[i]) {
				max = a[i];
				max_i = i;
			}
		}
		REP(i, n) {
			ml[i] = max - ml[i];
			mr[i] = max - mr[i];
		}
		auto cl(ml), cr(mr);
		RREP(i, n - 1) {
			(cl[i] += cl[i + 1]) %= MOD;
			(cr[i] += cr[i + 1]) %= MOD;
		}

		int I = max_i, J = n - max_i - 1;
		FOR(i, 1, std::min(I, J + 1)) {
			int sum = 0;
			{ // row
				int p = -1;
				[&] { // get position p
					int l = i - 1, r = J - 1;
					if (ml[i] >= mr[l]) return;
					if (ml[i] <= mr[r]) { p = J - 1; return; }
					while (l + 1 < r) {
						int m = (l + r) / 2;
						if (ml[i] > mr[m]) r = m;
						else l = m;
					}
					while (ml[i] > mr[r]) --r;
					p = r;
				}();

				if (p == -1) {
					(sum += cr[i - 1]) %= MOD;
				}
				else {
					(sum += ml[i] * (p + 2 - i) + cr[p + 1]) %= MOD;
				}
			}
			{ // col
				int p = -1;
				[&] { // get position p
					int l = i, r = I - 1;
					if (mr[i - 1] >= ml[l]) return;
					if (mr[i - 1] <= ml[r]) { p = I - 1; return; }
					while (l + 1 < r) {
						int m = (l + r) / 2;
						if (mr[i - 1] > ml[m]) r = m;
						else l = m;
					}
					while (mr[i - 1] > ml[r]) --r;
					p = r;
				}();

				if (p == -1) {
					(sum += cl[i]) %= MOD;
				}
				else {
					(sum += mr[i - 1] * (p + 1 - i) + cl[p + 1]) %= MOD;
				}
			}
			{ // cross
				sum -= std::min(ml[i], mr[i - 1]);
			}
			{ // norm
				sum %= MOD;
				if (sum < 0) sum += MOD;
			}
			{ // add
				(res += sum * i % MOD) %= MOD;
			}
		}
		return res;
	}

	int calc(const std::vector<int>& a) {
		int n = a.size();
		int res = 0;
		std::map<int, std::vector<int>> map;
		int max = 0;
		REP(i, n) {
			map[a[i]].emplace_back(i);
			CHMAX(max, a[i]);
		}

		REP(i, n + 1) { // top parallelogram
			(res += max * calcParallelogram(i, (i - 1) * i / 2 % MOD)) %= MOD;
		}

		std::set<PAIR> set;
		set.insert(PAIR(INFINT, INFINT));
		set.insert(PAIR(0, n));

		for (auto mit = map.rbegin(); mit != map.rend(); ++mit) {
			const int& x = mit->first;
			const auto& v(mit->second);
			for (auto& vi : v) {
				auto it = std::prev(set.lower_bound(PAIR(vi, INFINT)));
				int tl = it->first, tr = it->second;
				(res += x * calcParallelogramEX(vi - tl + 1, tr - vi)) %= MOD;

				set.erase(it);
				if (tl < vi) set.insert(PAIR(tl, vi));
				if (vi + 1 < tr) set.insert(PAIR(vi + 1, tr));
			}
		}

		res -= extra(a);

		res %= MOD;
		if (res < 0) res += MOD;
		return res;
	}
};

signed main() {
	INIT;
	VAR(int, n);
	VEC(int, a, n);
	if (0) {
		std::iota(ALL(a), 1);
		do {
			int oans = oldalgo::calc(a);
			int nans = newalgo::calc(a);
			if (oans != nans) {
				SHOWVECTOR(a);
				SHOW(oans);
				SHOW(nans);
				VAR(int, x);
			}
		} while (std::next_permutation(ALL(a)));
	}
	else {
		OUT(newalgo::calc(a))BR;
	}
	return 0;
}