#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    for (auto &&i : a) scanf("%lld", &i);
    for (auto &&i : b) scanf("%lld", &i);
    for (int i = 0; i < n; ++i) {
        a[i] += b[i];
    }
    vector<ll> S(n+1), T(n+1);
    for (int i = 0; i < n; ++i) {
        S[i+1] = S[i] + (i+1)*a[i];
        T[i+1] = T[i] + a[i];
    }
    for (int i = 1; i <= 2*n; ++i) {
        if(i > 1) printf(" ");
        int l = max(1, i-n), r = min(n, i-1);
        if(l > r) printf("0");
        else printf("%lld", i*(T[r]-T[l-1])-(S[r]-S[l-1]));
    }
    puts("");
    return 0;
}