Given an array $in$ of $n$ integers. Build an array $out$ such that $out_i$ is equal to the product of all the elements of $in$ except $in_i$. \InputFile The first line contains number $n~(1 < n \le 10^6)$. The second line contains $n$ integers, each number is not greater than $100$ by absolute value. \OutputFile Print the $out$ array. It is known that all printed values are not greater than $2 \cdot 10^9$ by absolute value.