#include <iostream>
#include <unordered_map>
#include <unordered_map>
#define DEGENERATE_BOUNDARY 2
#define NO_REMAINDER 0
using namespace std;

const int mod = 1e9 + 7;

int numberCount;

void declaration(){
    scanf("%d", &numberCount);
}

int numberToCalculate;

void inputSingleNumber(){
    scanf("%d", &numberToCalculate);
}

unordered_map<int, int> primeToCount;

void eachNumberCalculation(int numberToCalculate){
    for(int primeCandidate = DEGENERATE_BOUNDARY; primeCandidate <= numberToCalculate / primeCandidate; primeCandidate ++){
        while(numberToCalculate % primeCandidate == NO_REMAINDER){
            primeToCount[primeCandidate] ++;
            numberToCalculate /= primeCandidate;
        }
    }
    if(numberToCalculate > 1) primeToCount[numberToCalculate] ++;
}

void calculationIterate(){
    while(numberCount --){
        inputSingleNumber();
        eachNumberCalculation(numberToCalculate);
    }
}

long long totalSum = 1;//连乘公式的基底，勿忘记初始化为1

void outputSolution(){
    for(auto primeFactorPair : primeToCount){
        long long polynomialFactor = 1;
        long long primeFactorPower = 1;
        int primeFactor = primeFactorPair.first;
        int primeFactorExponent = primeFactorPair.second;
        while(primeFactorExponent --){
            primeFactorPower = primeFactorPower * primeFactor % mod;
            polynomialFactor = (polynomialFactor + primeFactorPower) % mod;
        }
        totalSum = totalSum * polynomialFactor % mod;
    }
    printf("%d", totalSum);
}

int main(){
    declaration();
    calculationIterate();
    outputSolution();
    return 0;
}