Chef Loves Numbers

You are given an integer sequence of length $n$, $A = [A_1, A_2, ..., A_n]$. - You get a new sequence $B$ of $n$ numbers from $A$ using the following relation: - $B_i$ = Product of all numbers of $A$ except $A_i$, where $1 \leq i \leq n$. - Let $X = \sum_{i = 1}^{i = n}$ Count of all factors of $B_i$. Calculate the value of $X$ modulo $10 ^ 9 + 7$. ###Input: - The first line of input contains a