#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif


void solve()
{
    int n;
    scanf("%d", &n);
    vector<ll> a(n), s(n + 1);
    for (int i = 0; i < n; i++) {
        scanf("%lld", &a[i]);
    }
    for (int i = 0; i < n; i++) {
        ll tmp;
        scanf("%lld", &tmp);
        a[i] += tmp;
        s[i + 1] = s[i] + a[i];
    }
    vector<ll> ans;
    ans.push_back(0);
    ll ss = 0;
    for (int i = 1; i < n * 2; i++) {
        int ii = min(i, n);
        ss += s[ii];
        if (i > n) {
            ss -= (n+1) * a[i - n - 1];
            ss -= s[i - n - 1];
        }        
        ans.push_back(ss);
    }
    for (int i = 0; i < n * 2; i++) {
        printf("%lld", ans[i]);
        if (i < n * 2 - 1) printf(" ");
        else printf("\n");
    }
    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}