Given an array of integers, construct an array such that each element out_i is equal to the product of all elements of the array except for in_i.
The first line contains an integer (1 < n \le 10^6). The second line contains integers, each with absolute value at most .
Print the array . It is guaranteed that the absolute value of each printed number does not exceed 2 \cdot 10^9.
Example 1
Example 2
Example 11