#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1);
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= n; ++i) cin >> b[i];

    vector sum(2, vector<ll>(n + 2));
    for(int i = 1; i <= n; ++i){
        sum[0][i + 1] = sum[0][i] + a[i];
        sum[1][i + 1] = sum[1][i] + b[i];
    }

    vector<ll> c(n * 2 + 1);
    int l = 1;
    ll s = 0;
    for(int i = 1; i <= n; ++i){
        c[i] = s;
        s += sum[0][i + 1] + sum[1][i + 1];
    }
    for(int i = n + 1; i <= n * 2; ++i){
        c[i] = s;
        s += sum[0][n + 1] - sum[0][i - n + 1];
        s += sum[1][n + 1] - sum[1][i - n + 1];
        s -= 1LL * n * (a[i - n] + b[i - n]);
    }

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

    return 0;
}