#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 1000000007
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)
vector<complex<double>>  DFT(vector<complex<double>> a) {
	int n = a.size();
	if (n == 1) return a;
	vector<complex<double>> a0(n / 2), a1(n / 2);
	REP(i, n) {
		if (i % 2 == 0) {
			a0[i / 2] = a[i];
		}
		else {
			a1[i / 2] = a[i];
		}
	}
	vector<complex<double>> inversed_a0 = DFT(a0), inversed_a1 = DFT(a1);
	vector<complex<double>> inversed_a(n);
	for (int i = 0; i < n; ++i) {
		complex<double> zeta = complex<double>(cos(2 * Ma_PI * i / n), sin(2 * Ma_PI * i / n));
		inversed_a[i] = inversed_a0[i % (n / 2)] + zeta * inversed_a1[i % (n / 2)];
	}
	return inversed_a;
}
vector<complex<double>> IDFT(vector<complex<double>> inversed_a) {
	int n = inversed_a.size();
	vector<complex<double>> now = DFT(inversed_a);
	reverse(now.begin(), now.end());
	for (int q = now.size() - 1; q >= 1; --q) {
		swap(now[q], now[q - 1]);
	}
	REP(i, n) {
		now[i] /= complex<double>(n, 0);
	}
	return now;
}
vector<complex<double>> conv(vector<complex<double>> a, vector<complex<double>> b) {
	int deg = a.size() + b.size() - 1;
	int n = 1;
	while (n < deg) n <<= 1;
	a.resize(n);
	b.resize(n);
	vector<complex<double>> inversed_a = DFT(a), inversed_b = DFT(b);
	vector<complex<double>> inversed_c(n);
	REP(i, n) {
		inversed_c[i] = inversed_a[i] * inversed_b[i];
	}
	return IDFT(inversed_c);
}
long long powing(long long now,long long hoge) {
	long long ans = 1;
	while (hoge != 0) {
		if (hoge % 2 == 1) {
			ans *= now;
			ans %= MOD;
		}
		hoge /= 2;
		now *= now;
		now %= MOD;
	}
	return ans;
}
long long inv(long long now) {
	return powing(now, MAX_MOD - 2LL);
}
pair<long long,long long> minnest[200000];
int main() {
	long long n;
	cin >> n;
	vector<long long> inputs;
	long long nya = 0;
	REP(i, n) {
		long long a;
		cin >> a;
		nya = max(nya, a);
		inputs.push_back(a);
	}
	vector<complex<double>> a;
	for (int i = 0; i <= nya; ++i) {
		a.push_back(complex<double>());
	}
	REP(i, n) {
		a[inputs[i]] += complex<double>(1.0,0.0);
	}
	vector<complex<double>> now = conv(a, a);
	REP(i, n) {
		now[inputs[i] * 2] -= complex<double>(1.0, 0.0);
	}
	long long ans = 1;
	for (int i = 2; i < now.size(); ++i) {
		long long cnt = round(now[i].real());
		cnt /= 2;
		ans *= powing(i, cnt);
		//ans %= MAX_MOD;
	}
	long long cnt = 0;
	for (int i = 0; i < n; ++i) {
		cnt += inputs[i];
	}
	for (int i = 0; i < n; ++i) {
		cnt -= inputs[i];
		ans *= powing(inputs[i], cnt);
		ans %= MAX_MOD;
	}
	minnest[n].first = 1000000;
	for (int i = n - 1; i >= 0; --i) {
		if (inputs[i] < minnest[i+1].first) {
			minnest[i] = make_pair(inputs[i], i);
		}
		else {
			minnest[i] = minnest[i + 1];
		}
	}
	long double bobo = LONG_INF;
	pair<long long, long long>tmp;
	for (int i = 0; i < n-1; ++i) {
		long double geko = log10(inputs[i] + minnest[i+1].first) + log10(inputs[i]) * (long double)minnest[i+1].first;
		if (bobo > geko) {
			bobo = geko;
			tmp = make_pair(i, minnest[i + 1].second);
		}
	}
	ans *= inv(inputs[tmp.first] + inputs[tmp.second]);
	ans %= MAX_MOD;
	ans *= inv(powing(inputs[tmp.first], inputs[tmp.second]));
	ans %= MAX_MOD;
	cout << ans << endl;
	return 0;
}