#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int power(int n, int exp) {
  if (exp == 0) return 1;
  int temp = power(n, exp / 2);
  if (exp % 2 == 0)
    return (temp * 1LL * temp) % mod;
  else
    return (((temp * 1LL * temp) % mod) * 1LL * n) % mod;
}
int main(int argc, char *argv[]) {
  ios::sync_with_stdio(false);
  int m;
  cin >> m;
  int p, n = 1;
  map<int, int> times;
  for (int i = 0; i < m; i++) {
    cin >> p;
    times[p]++;
    n = (n * 1LL * p) % mod;
  }
  int divisors = 1;
  bool tworemaining = true;
  for (map<int, int>::iterator iter = times.begin(); iter != times.end();
       iter++) {
    int multiplier = (1 + iter->second);
    if (multiplier % 2 == 0 && tworemaining) {
      multiplier /= 2;
      tworemaining = false;
    }
    divisors = (divisors * 1LL * multiplier) % (mod - 1);
  }
  if (tworemaining) {
    int tempn = 1;
    for (map<int, int>::iterator iter = times.begin(); iter != times.end();
         iter++) {
      for (int i = 0; i < iter->second / 2; i++) {
        tempn = (tempn * 1LL * iter->first) % mod;
      }
    }
    n = tempn;
  }
  cout << power(n, divisors) << '\n';
}
