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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;
    auto a = vec<int>(uns, n);
    auto b = vec<int>(uns, n);
    for (auto &e : a) cin >> e;
    for (auto &e : b) cin >> e;

    auto acc = vec<int64_t>(uns, n + 1);

    acc[0] = 0;
    for (int i = 0; i < n; ++i) {
        acc[i + 1] = acc[i] + a[i] + b[i];
    }

    auto c = vec<int64_t>(uns, 2 * n);

    int64_t sum = 0;
    for (int i = 0; i < 2 * n; ++i) {
        sum += acc[min(n, i)] - acc[max(0, i - n)];
        sum -= (acc[max(0, i - n)] - acc[max(0, i - n - 1)]) * n;
        c[i] = sum;
    }

    cout << c[0];
    for (int i = 1; i < 2 * n; ++i) {
        cout << ' ' << c[i];
    }
    cout << endl;
}