Elementwise Product of Two Arrays

Source: Problem Solving and Program Design in C

Version: Phuoc Hung OJ Extended

Problem Statement

Given two integer arrays $X=(x_0,x_1,\ldots,x_{n-1})$ and $Y=(y_0,y_1,\ldots,y_{n-1})$ of equal length, compute their elementwise product:

Print the full array $Z=(z_0,z_1,\ldots,z_{n-1})$.

Input

• The first line contains $n$.
• The second line contains the $n$ integers of $X$.
• The third line contains the $n$ integers of $Y$.

Output

Print one line containing $z_0,z_1,\ldots,z_{n-1}$ separated by single spaces.

Subtasks

Subtask 1 (100 points): $1\le n\le10^5$, $|x_i|\le10^9$, and $|y_i|\le10^9$. Every product fits in signed 64-bit long long.

Examples

Input

5
2 -3 4 0 10
5 2 -1 7 -2

Output

10 -6 -4 0 -20

Explanation

The corresponding products are $2\cdot5=10$, $(-3)\cdot2=-6$, $4\cdot(-1)=-4$, $0\cdot7=0$, and $10\cdot(-2)=-20$.