代码

#include <iostream>
#include <unordered_map>

using namespace std;

typedef long long LL;

const int mod = 1e9 + 7;

int main()
{
    int n;
    cin >> n;

    unordered_map<int, int> primes;

    while (n--) {
        int x;
        cin >> x;

        for (int i = 2; i <= x / i; i++) {
            while (x % i == 0) {
                x /= i;
                primes[i]++;
            }
        }

        if (x > 1) {
            primes[x]++;
        }
    }

    LL res = 1;
    for (auto p : primes) {
        LL a = p.first, b = p.second;  // a, b -> 底数和指数

        // 秦九昭算法
        // 求 p^b+p^(b-1)+....+p^1+1
        LL t = 1;
        while (b--) {
            t = (t * a + 1) % mod;
        }

        res = (res * t) % mod;
    }
    cout << res << endl;
    return 0;
}