For two sequences S and T of length N consisting of 0 and 1, let us define f(S, T) as follows:

* Consider repeating the following operation on S so that S will be equal to T. f(S, T) is the minimum possible total cost of those operations.

* Change S_i (from 0 to 1 or vice versa). The cost of this operation is D \times C_i, where D is the number of integers j such that S_j \neq T_j (1 \leq j \leq N) just before this change.



There are 2^N \times (2^N - 1) pairs (S, T) of different sequences of length N consisting of 0 and 1. Compute the sum of f(S, T) over all of those pairs, modulo (10^9+7).

Constraints

* 1 \leq N \leq 2 \times 10^5
* 1 \leq C_i \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
C_1 C_2 \cdots C_N


Output

Print the sum of f(S, T), modulo (10^9+7).

Examples

Input

1
1000000000


Output

999999993


Input

2
5 8


Output

124


Input

5
52 67 72 25 79


Output

269312
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, c[200010];
ll mod = 1e9+7;

ll p(ll a, ll b) {
    if (b < 0) return 0;
    if (b == 0) return 1LL;
    if (b == 1) return a;
    ll ret = p(a, b/2);
    ret *= ret;
    ret %= mod;
    if (b&1) ret *= a;
    return ret % mod;
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> c[i];
    sort(c,c+n);
    reverse(c,c+n);
    ll base = p(2LL,n-1);
    ll inc = p(2LL, n-2);
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        ans += c[i] * base % mod;
        ans %= mod;
        base += inc;
        base %= mod;
    }
    cout << ans * p(2LL, n) % mod << endl;
    return 0;
}