#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];
	for(int i=1;i<=m;i++) cin>>b[i];
	for(int i=1;i<=m;i++) cin>>c[i];
	vector<int> ab,bc;
	int sum=0,res1=0,res2=0;
	for(int i=1;i<=m;i++)
	{
		sum+=c[i]+a[i];
		if(a[i]&&b[i]) ab.push_back(i);
		else if(b[i]&&c[i]) bc.push_back(i);
		
	}
	for(auto i:ab)
		res1+=min(a[i]+c[i],b[i]);
	if(!res1){
		for(int i=1;i<m;i++) cout<<a[i]+c[i]<<" ";
			cout<<a[m]+c[m]<<endl<<sum<<endl;
		return ;
	}
	for(auto i:bc) 
		res2+=min(b[i],c[i]+1);
	
	for(int i=1;i<=m;i++)
	{
		if(!b[i]) cout<<res1+res2+a[i]+c[i]-1;
		else 
		{
			if(a[i]) cout<<res1-min(a[i]+c[i],b[i])+res2+a[i]+c[i]-1;
			else if(!c[i]) cout<<res1+res2-1;
			else cout<<res1+res2-1-min(b[i],c[i])+c[i];
		}
		if(i==m) cout<<endl;
		else cout<<" ";
	}
	cout<<sum<<endl;
}
signed main()
{
	IOS;
	int _=1;
	while(_--)
		solve();
	return 0;
}