using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var list = new List<(int num, int count)>();
        for (var i = 0; i < n; ++i)
        {
            if (list.Count > 0 && list[^1].num == 1 && a[i] == 1)
            {
                list[^1] = (a[i], list[^1].count + 1);
            }
            else
            {
                list.Add((a[i], 1));
            }
        }
        var ans = 1L;
        var mod = 1_000_000_007;
        for (var i = 0; i < list.Count; ++i)
        {
            var mul = (long)list[i].num;
            if (mul == 0)
            {
                ans = 0;
                break;
            }
            for (var j = i; j < list.Count; ++j)
                {
                    if (i == j)
                    {
                        ans = ans * mul % mod;
                    }
                    else
                    {
                        mul *= list[j].num;
                        if (mul >= 1_000_000_000) break;
                        ans = ans * Exp(mul, (long)list[i].count * list[j].count, mod) % mod;
                    }
                }
        }
        WriteLine(ans);
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}