Problem:
Score : 500 points

Problem Statement

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).

Sample Input 1

1
1000000000

Sample Output 1

999999993

There are two pairs (S, T) of different sequences of length 2 consisting of 0 and 1, as follows:

S = (0), T = (1): by changing S_1 to 1, we can have S = T at the cost of 1000000000, so f(S, T) = 1000000000.

S = (1), T = (0): by changing S_1 to 0, we can have S = T at the cost of 1000000000, so f(S, T) = 1000000000.

The sum of these is 2000000000, and we should print it modulo (10^9+7), that is, 999999993.

Sample Input 2

2
5 8

Sample Output 2

124

There are 12 pairs (S, T) of different sequences of length 3 consisting of 0 and 1, which include:

S = (0, 1), T = (1, 0)

In this case, if we first change S_1 to 1 then change S_2 to 0, the total cost is 5 \times 2 + 8 = 18. We cannot have S = T at a smaller cost, so f(S, T) = 18.

Sample Input 3

5
52 67 72 25 79

Sample Output 3

269312

Solution in Rust (1.42.0) (judge verdict: Wrong Answer)

// sum_d sum_s sum_{t s.t. d(s,t) = d} C(1) + 2 C(2) + ... + d C(d)
//
// C(1) >= C(2) >= ...
//
// (s, t) such that s[i1] != t[i1], ..., s[ik] != t[ik] について
//   C(i1) + 2 C(i2) ... + k C(ik)
// を全部の (s,t) で足しあげたい
//
// C(i) の contribution. j < i に k 回違うのがあると k C(i)
// そういうのは (i-1 choose k-1) 2^{i-1} 4^{n-i} k C(i)
//
// これを k について総和すると 4^{n-1} (i+1) C(i)
//
use proconio::input;

#[derive(Copy,Clone,Eq,PartialEq)]
struct ModInt {
  val: isize,
}
impl ModInt {
  const MOD: isize = 1_000_000_007;
  fn new(val: isize) -> Self {
    Self { val } 
  }
  fn pow(self, mut e: isize) -> Self {
    let mut a = self.val;
    let mut x = 1;
    while e > 0 {
      if e % 2 == 1 { 
        x = (x * a) % ModInt::MOD;
      } else {
        a = (a * a) % ModInt::MOD;
      }
      e /= 2;
    }
    Self { val: x }
  }
}
impl std::ops::Add for ModInt {
  type Output = Self;
  fn add(self, other: Self) -> Self { 
    let a = self.val + other.val;
    Self { 
      val: if a >= ModInt::MOD { a - ModInt::MOD } else { a } 
    }
  }
}
impl std::ops::Mul for ModInt {
  type Output = Self;
  fn mul(self, other: Self) -> Self { 
    let a = self.val * other.val;
    Self { 
      val: a % ModInt::MOD
    }
  }
}

fn main() {
  input! {
    n: usize,
    mut c: [isize; n],
  }
  c.sort();
  c.reverse();

  let mut ans = ModInt::new(0);
  for i in 0..n {
    ans = ans + ModInt::new(4).pow(n as isize -1) * ModInt::new(i as isize + 2) * ModInt::new(c[i]);
  }
  println!("{}", ans.val);
}