Problem:
You are given n integers a1,a2,…,an. Each of ai has between 3 and 5 divisors. Consider a=∏ai — 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.
Input Format:
The first line contains a single integer n (1≤n≤500) — the number of numbers.
Each of the next n lines contains an integer ai (1≤ai≤2⋅1018). It is guaranteed that the number of divisors of each ai is between 3 and 5.
Output Format:
Print a single integer d — the number of divisors of the product a1⋅a2⋅⋯⋅an modulo 998244353.
Hacks input
For hacks, the input needs to be provided in a special format.
The first line contains an integer n (1≤n≤500) — the number of numbers.
Each of the next n lines contains a prime factorization of ai. The line contains an integer ki (2≤ki≤4) — the number of prime factors of ai and ki integers pi,j (2≤pi,j≤2⋅1018) where pi,j is the j-th prime factor of ai.
Before supplying the input to the contestant, ai=∏pi,j are calculated. Note that each pi,j must be prime, each computed ai must satisfy ai≤2⋅1018 and must have between 3 and 5 divisors. The contestant will be given only ai, and not its prime factorization.
For example, you need to use this test to get the first sample:
Note:
In the first case, a=19305. Its divisors are 1,3,5,9,11,13,15,27,33,39,45,55,65,99,117,135,143,165,195,297,351,429,495,585,715,1287,1485,1755,2145,3861,6435,19305 — a total of 32.
In the second case, a has four divisors: 1, 86028121, 86028157, and 7400840699802997.
In the third case a=202600445671925364698739061629083877981962069703140268516570564888699375209477214045102253766023072401557491054453690213483547.
In the fourth case, a=512=29, so answer equals to 10.