A12012 | Divisors

You are given $n$ integers $a_1, a_2, \ldots, a_n$ . Each of $a_i$ has between $3$ and $5$ divisors. Consider $a = \prod a_i$ — the product of all input integers. Find the number of divisors of $a$ . As this number may be very large, print it modulo prime number $998244353$ .

The first line contains a single integer $n$ ( $1 \leq n \leq 500$ ) — the number of numbers.

Each of the next $n$ lines contains an integer $a_i$ ( $1 \leq a_i \leq 2\cdot 10^{18}$ ). It is guaranteed that the number of divisors of each $a_i$ is between $3$ and $5$ .

Print a single integer $d$ — the number of divisors of the product $a_1 \cdot a_2 \cdot \dots \cdot a_n$ modulo $998244353$ .

Hacks input

For hacks, the input needs to be provided in a special format.

The first line contains an integer $n$ ( $1 \leq n \leq 500$ ) — the number of numbers.

Each of the next $n$ lines contains a prime factorization of $a_i$ . The line contains an integer $k_i$ ( $2 \leq k_i \leq 4$ ) — the number of prime factors of $a_i$ and $k_i$ integers $p_{i,j}$ ( $2 \leq p_{i,j} \leq 2 \cdot 10^{18}$ ) where $p_{i,j}$ is the $j$ -th prime factor of $a_i$ .

Before supplying the input to the contestant, $a_i = \prod p_{i,j}$ are calculated. Note that each $p_{i,j}$ must be prime, each computed $a_i$ must satisfy $a_i \leq 2\cdot10^{18}$ and must have between $3$ and $5$ divisors. The contestant will be given only $a_i$ , and not its prime factorization.

For example, you need to use this test to get the first sample:

<br></br>3<br></br>2 3 3<br></br>2 3 5<br></br>2 11 13<br></br>Interaction

From the technical side, this problem is interactive. Therefore, do not forget to output end of line and flush the output. Also, do not read more than you need. To flush the output, use:

- fflush(stdout) or cout.flush() in C++;
- System.out.flush() in Java;
- flush(output) in Pascal;
- stdout.flush() in Python;
- see documentation for other languages.