/* -*- coding: utf-8 -*-
 *
 * 1618.cc:  No.1618 Convolution? - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N + 1], bs[MAX_N + 1];
ll cs[MAX_N * 2 + 2];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", as + i);
  for (int i = 1; i <= n; i++) scanf("%d", bs + i);

  // c1 = 0
  // c2 = 1*a1+1*b1
  // c3 = (1*a2+2*b1)+(2*a1+1*b2) = 1*(a2+b2)+2*(a1+b1)
  // c4 = (1*a3+3*b1)+(2*a2+2*b2)+(3*a1+1*b3) = 1*(a3+b3)+2*(a2+b2)+3*(a1+b1)
  // ck = sum_{i+j=k} i*(aj+bj)

  int n2 = n * 2;
  ll d = 0, sum = 0;
  for (int i = 1; i < n2; i++) {
    if (i <= n)
      d += as[i] + bs[i];
    else {
      int abi = as[i - n] + bs[i - n];
      d -= abi, sum -= (ll)n * abi;
    }
    sum += d;
    cs[i + 1] = sum;
  }

  for (int i = 1; i <= n2; i++)
    printf("%lld%c", cs[i], (i < n2) ? ' ' : '\n');
  return 0;
}