using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        WriteLine(Zig(n, a));
    }
    static long Zig(int n, int[] a)
    {
        var list = new List<int>(new HashSet<int>(a));
        list.Add(0);
        list.Sort();
        var dic = new Dictionary<int, int>();
        for (var i = 0; i < list.Count; ++i) dic[list[i]] = i;
        var mod = 1_000_000_007;
        var two = new long[n];
        two[0] = 1;
        for (var i = 1; i < two.Length; ++i) two[i] = two[i - 1] * 2 % mod;
        var ld = new long[n];
        var lu = new long[n];
        var ft = new FenwickTree(list.Count);
        for (var i = 0; i < n; ++i)
        {
            ld[i] = (ft.Sum(list.Count - 1) % mod + mod - ft.Sum(dic[a[i]]) % mod) % mod;
            lu[i] = ft.Sum(dic[a[i]] - 1) % mod;
            ft.Add(dic[a[i]], two[i]);
        }
        ft = new FenwickTree(list.Count);
        var rd = new long[n];
        var ru = new long[n];
        for (var i = n - 1; i >= 0; --i)
        {
            rd[i] = (ft.Sum(list.Count - 1) % mod + mod - ft.Sum(dic[a[i]]) % mod) % mod;
            ru[i] = ft.Sum(dic[a[i]] - 1) % mod;
            ft.Add(dic[a[i]], two[n - i - 1]);
        }
        var ans = 0L;
        for (var i = 0; i < n; ++i) ans = (ans + ld[i] * rd[i] % mod + lu[i] * ru[i] % mod) % mod;
        return ans;
    }
    class FenwickTree
    {
        int size;
        long[] tree;
        public FenwickTree(int size)
        {
            this.size = size;
            tree = new long[size + 2];
        }
        public void Add(int index, long value)
        {
            ++index;
            for (var x = index; x <= size; x += (x & -x)) tree[x] += value;
        }
        /// <summary>先頭からindexまでの和(include index)</summary>
        public long Sum(int index)
        {
            if (index < 0) return 0;
            ++index;
            var sum = 0L;
            for (var x = index; x > 0; x -= (x & -x)) sum += tree[x];
            return sum;
        }
        /// <summary>Sum(x) >= value となる最小のxを求める</summary>
        // 各要素は非負であること
        public int LowerBound(long value)
        {
            if (value < 0) return -1;
            var x = 0;
            var b = 1;
            while (b * 2 <= size) b <<= 1;
            for (var k = b; k > 0; k >>= 1)
            {
                if (x + k <= size && tree[x + k] < value)
                {
                    value -= tree[x + k];
                    x += k;
                }
            }
            return x;
        }
    }
}