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

#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);

using Graph = vector<vector<ll>>;


//typedef atcoder::modint998244353 mint;
//typedef atcoder::modint1000000007 mint;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);


    int n; cin >> n;
    vector<ll> c(n);
    vector<ll> a(n), b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];

    rep(i, n) c[i] = a[i] + b[i];

    vector<ll> sum(n + 1, 0);
    rep(i, n) sum[i + 1] = sum[i] + c[i];

    vector<ll> res(2 * n);
    ll cur = 0;
    rep(i, 2 * n) {
        if (i < n) {
            res[i] = cur;
            cur += sum[i + 1];
        }
        else {
            res[i] = cur;
            cur -= n * c[i - n];
            cur += sum[n] - sum[i - n + 1];
        }
    }

    rep(i, 2 * n) {
        cout << res[i] << " ";
    }
    cout << endl;
}