#include<bits/stdc++.h>
using namespace std;
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld%lld",&x,&y)
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pf(x) printf("%lld",x)
#define pii pair<int,int> 
#define f first 
#define s second
#define int long long



//
const int N = 1e6+10;
int ss;
int res=0;
int a[N],b[N],c[N];
//
//


void solve()
{
	int m;
	cin>>m;
	
	for(int i=1;i<=m;i++) cin>>a[i],ss+=a[i];
	for(int i=1;i<=m;i++) cin>>b[i];
	for(int i=1;i<=m;i++) cin>>c[i];
	if(!ss)
	{
		for(int i=1;i<=m;i++) cout<<0<<" ";
		cout<<endl<<0<<endl;
		return ;
	}
	vector<int> aa,bc;
	int sum=0;
	for(int i=1;i<=m;i++)
	{
		sum+=c[i]+a[i];
		if(a[i])
		{
			a[i]+=c[i];
			aa.push_back(i);
		}
		else if(b[i]&&c[i]) bc.push_back(i);
		
	}
	int res=0;
	
	for(auto i:aa)
		res+=min(a[i],b[i]);
	if(res){
		for(auto i:bc)
			res+=min(b[i],c[i]);
		res-=bc.size();
	}
	for(int i=1;i<=m;i++)
	{
		if(a[i]) cout<<res-min(a[i],b[i])+a[i];
		else cout<<res-min(b[i],c[i])+1+c[i];
		if(i==m) cout<<endl;
		else cout<<" ";
	}
	cout<<sum<<endl;
}
signed main()
{
	IOS;
	int _=1;
	while(_--)
		solve();
	return 0;
}