Useful Number

You are given an integer sequence $A_1, A_2, \dots, A_N$. Let's define the *useful number* of a subsequence of $A$ as the number of distinct primes $p$ such that $p$ divides each member of the subsequence, multiplied by the length of the subsequence. Find the maximum of useful numbers of all subsequences of $A$. ### Input - The first line of the input contains a single integer $T$ denoting the nu