Given an integer array nums, return an array answer such that answer[i] equals the product of all elements except nums[i].

You must solve it in O(n) time and without using division.

Example 1:

Input: 1 2 3 4
Output: 24 12 8 6

Example 2:

Input: -1 1 0 -3 3
Output: 0 0 9 0 0

Constraints:

• 2 ≤ nums.length ≤ 10⁵
• -30 ≤ nums[i] ≤ 30

Input format: Space-separated integers.

Output format: Space-separated product array.