SOLVE
LATER
Having a good previous year, Monk is back to teach algorithms and data structures. This year he welcomes the learners with a problem which he calls "Welcome Problem". The problem gives you two arrays A and B (each array of size N) and asks to print new array C such that:
\(C[i]=A[i]+B[i]\) ; \(1 \le i \le N\)
Now, Monk will proceed further when you solve this one. So, go on and solve it :)
Input:
First line consists of an integer N, denoting the size of A and B.
Next line consists of N space separated integers denoting the array A.
Next line consists of N space separated integers denoting the array B.
Output:
Print N space separated integers denoting the array C.
Input Constraints:
\(1 \le N \le 100000\)
\(1 \le A[i] \le 100000\); \(1 \le i \le N\)
\(1 \le B[i] \le 100000\); \(1 \le i \le N\)
The output array is the addition of input arrays A and B.