#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n);
  REP(i, n) cin >> a[i];
  REP(i, n) cin >> b[i];
  vector<ll> c(n * 2, 0), d(n * 2, 0);
  ll x = 0;
  REP(i, n * 2) {
    if (i > 0) c[i] = c[i - 1];
    if (i > n) {
      c[i] -= 1LL * a[i - (n + 1)] * n;
      x -= a[i - (n + 1)];
    }
    c[i] += x;
    if (i < n) x += a[i];
  }
  x = 0;
  REP(i, n * 2) {
    if (i > 0) d[i] = d[i - 1];
    if (i > n) {
      d[i] -= 1LL * b[i - (n + 1)] * n;
      x -= b[i - (n + 1)];
    }
    d[i] += x;
    if (i < n) x += b[i];
  }
  REP(i, n * 2) cout << c[i] + d[i] << " \n"[i + 1 == n * 2];
  return 0;
}