#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
vector<ll> A,B;

vector<ll> get_transformed(int n){
  vector<ll> res(n*2+1);
  vector<ll> res2(n*2+1);
  rep(i,n){
    ll a; cin >> a;
    res[i+1] += a;
    res[i+1+n] -= a;
    res2[i+1+n] -= a*n;
  }
  rep(i,n*2) res[i+1] += res[i];
  rep(i,n*2) res[i] += res2[i];
  rep(i,n*2) res[i+1] += res[i];
  res.pop_back();
  return move(res);
}

int main(){
  cin >> N;
  A = get_transformed(N);
  B = get_transformed(N);
  rep(i,2*N) A[i] += B[i];
  rep(i,2*N){ if(i) cout << " "; cout << A[i]; } cout << "\n";
  return 0;
}