#CCBCHBAHAI0000136. Cộng hai mảng theo từng vị trí (Elementwise Sum of Two Arrays)

Cộng hai mảng theo từng vị trí (Elementwise Sum of Two Arrays)

Elementwise Sum of Two Arrays

Source: C Primer Plus

Version: Phuoc Hung OJ Extended

Problem Statement

Given two integer arrays A=(a0,a1,…,an−1)A=(a_0,a_1,\ldots,a_{n-1}) and B=(b0,b1,…,bn−1)B=(b_0,b_1,\ldots,b_{n-1}) of the same length, construct CC by adding corresponding elements:

ci=ai+bi,0≤i<n.c_i=a_i+b_i,\qquad 0\le i<n.

The element order must not be changed.

Input

  • The first line contains nn.
  • The second line contains the nn integers of AA.
  • The third line contains the nn integers of BB.

Output

Print one line containing c0,c1,…,cn−1c_0,c_1,\ldots,c_{n-1} separated by single spaces.

Subtasks

Subtask 1 (100 points): 1≤n≤1051\le n\le10^5, ∣ai∣≤109|a_i|\le10^9, and ∣bi∣≤109|b_i|\le10^9.

Examples

Input

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

Output

11 0 3 11 6

Explanation

Add corresponding positions: 1+10=111+10=11, 2+(−2)=02+(-2)=0, 3+0=33+0=3, 4+7=114+7=11, and 5+1=65+1=6. Thus C=(11,0,3,11,6)C=(11,0,3,11,6).