#include <bits/stdc++.h>
using namespace std;
//*
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
//*/
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll mypowl(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

template <class T> class zarts
{
public:
  int N;
  vector<T> vals;
  vector<T> vec;
  // map<T, int> mp;
  unordered_map<T, int> mp;
  zarts(const vector<T> &V, int cnt = 0)
  {
    N = V.size();

    vals = vector<T>(V);
    sortunique(vals);
    for (auto v : vals)
    {
      mp[v] = cnt;
      cnt++;
    }

    vec.resize(N);
    for (int i = 0; i < N; i++)
      vec[i] = mp[V[i]];
  }
};

int main()
{
  ll N;
  cin >> N;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }
  A = zarts(A).vec;

  vector<mint> B(N), C(N), D(N), E(N);
  fenwick_tree<mint> fw1(N), fw2(N);
  for (ll i = 0; i < N; i++)
  {
    B.at(i) = fw1.sum(0, A.at(i));
    D.at(i) = fw1.sum(A.at(i) + 1, N);
    fw1.add(A.at(i), mint(2).pow(i));
  }
  for (ll i = N - 1; i >= 0; i--)
  {
    C.at(i) = fw2.sum(0, A.at(i));
    E.at(i) = fw2.sum(A.at(i) + 1, N);
    fw2.add(A.at(i), mint(2).pow(N - 1 - i));
  }

  mint ans = 0;
  for (ll i = 0; i < N; i++)
  {
    mint tmp1 = B.at(i) * C.at(i);
    mint tmp2 = D.at(i) * E.at(i);
    ans += tmp1 + tmp2;
  }
  cout << ans.val() << endl;
}