#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define all(a) begin(a), end(a)
#define sz(x) (int)((x).size())

#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) 42
#endif

void solve() {
  int n; cin >> n;
  vector<ll> a(n + 1);
  for (int i = 1; i <= n; i++) {
    ll x; cin >> x; a[i] += x;
  }
  for (int i = 1; i <= n; i++) {
    ll x; cin >> x; a[i] += x;
  }
  vector<ll> s1(n + 1), s2(n + 1);
  for (int i = 1; i <= n; i++) {
    s1[i] = s1[i - 1] + a[i];
    s2[i] = s2[i - 1] + i * a[i];
  }
  for (int i = 1; i <= n * 2; i++) {
    int r = min(n, i - 1);
    int l = max(1, i - n) - 1;
    ll val = i * (s1[r] - s1[l]) - (s2[r] - s2[l]);
    cout << val << " \n"[i == n * 2];
  }
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int T = 1;
  // cin >> T;
  while (T--) solve();

  return 0;
}