#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint1000000007;
using vm = vector<mint>;
template<class T> map<T, int> coord_comp(set<T> s) {
	int a = 0;
	map<T, int> m;
	for (auto u : s) m[u] = ++a;
	return m;
}

int main() {
	lint N;
	cin >> N;
	vi v(N);
	vin(v);

	mint a=0, b=0, c=0;
	lint x, y, z;
	set<lint> s;
	rep(i, N) s.insert(v[i]);
	map<lint, int> m = coord_comp(s);
	fenwick_tree<mint> l(N+2), r(N+2), f(N+2);
	a = 1, b = ((mint)2).pow(N-1);
	rep(i, N) {
		x = m[v[i]];
		c += l.sum(0, x)*b;
		c += r.sum(x+1, N+2)*b;
		f.add(x, a);
		l.add(x, f.sum(x+1, N+2));
		r.add(x, f.sum(0, x));
		a *= 2;
		b /= 2;
	}
	std::cout << c.val() << '\n';
}