#include<bits/stdc++.h>
#define rg register
#define il inline
#define int long long
using namespace std;

const int p = 1e9 + 7, N = 200005;
int n, m, k, x, ans;
int a[N];
int f[N];

il void init(int n){
	f[0] = 1;
	for (int i = 1; i <= n; i++) f[i] = 1ll * f[i - 1] * i % p;
}

il int qpow(int a, int b){
	int ans = 1, base = a;
	while(b){
		if (b & 1) ans = 1ll * ans * base % p;
		base = 1ll * base * base % p;
		b >>= 1;
	}
	return ans;
}

il int C(int n, int m){
	if (m > n || m < 0) return 0;
	return 1ll * f[n] * qpow(f[m], p - 2) % p * qpow(f[n - m], p - 2) % p;
}

il int rd(){
	char c = getchar(); 
	int n = 0;
	while (c < '0' || c > '9'){ 
		c = getchar(); 
	}
	while (c >= '0' && c <= '9'){ 
		n = (n << 1) + (n << 3) + (c & 15); 
		c = getchar(); 
	}
	return n;
}

signed main(){
	n = rd();
	init(n);
	for (int i = 1; i <= n; i++) a[i] = rd();
	sort(a + 1, a + n + 1);
	int ans = 0;
	for (int i = 1; i <= n; i++){
		int res = C(i - 1, a[i] - 1);
		res %= p;
		int cnt = qpow(2, n - i);
		cnt %= p;
		ans = (ans % p + res * cnt % p) % p;
	}
	cout << ans;
	return 0;
}