import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        Arrays.sort(A);
        //BigInteger res = new BigInteger("");
        long res=0;
        
        int n = A.length;
        int x=0,i=0;
        //System.out.println(n);
        for(;i<n-1;i++){        	
        	res+=((A[i]*Math.pow(3, i))%(Math.pow(10, 9)+7));        	
        	x+=Math.pow(3, i);
        	//System.out.println(res+" "+x);
        }
        long len = (n*(n+1))/2;
        long len1=(len*(len+1))/2;
        res = (long) (res%(Math.pow(10, 9)+7));
        //System.out.println(len1);
        res+=((A[i]*(len1-x))%(Math.pow(10, 9)+7));
        return (int) (res%(Math.pow(10, 9)+7));
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int result = solve(a);
        System.out.println(result);
        in.close();
    }
}