#include<bits/stdc++.h>
using i64 = long long;
#define int i64
void solve() {
	int n;
	std::cin >> n;
	std::vector<std::array<int, 4> > a(n + 1);
	std::vector<int> e(n + 1);
	for (int i = 1; i <= n; i ++) {
		std::cin >> a[i][0];
	}
	for (int i = 1; i <= n; i ++) {
		std::cin >> a[i][1];
	}
	for (int i = 1; i <= n; i ++) {
		std::cin >> a[i][2];
		a[i][3] = i;
	}
	i64 sum = 0, res = 0;
	for (int i = 1; i <= n; i ++) {
		if (a[i][0] && a[i][1]) {
			e[a[i][3]] = 1;
			sum += a[i][0] + a[i][2];
			res += std::min(a[i][0] + a[i][2], a[i][1]);
		}
	}
	std::sort(a.begin() + 1, a.end(), [&](auto x, auto y) {
		return x[1] > y[1];
	});
	for (int i = 1; i <= n; i ++) {
		if (e[a[i][3]]) continue;
		if (! a[i][0]) {	
			if (! res) continue;
			res --;
			sum += a[i][2];
			res += std::min(a[i][2] + 1ll, a[i][1]);
		} else if (! a[i][1]) { // a[i]
			sum += a[i][0] + a[i][2];
		}
	}

	std::vector<int> d(n + 1);
	i64 op = 0;
	res = 0;
	for (int i = 1; i <= n; i ++) {
		if (a[i][0] && a[i][1]) {
			d[a[i][3]] = std::min(a[i][1], a[i][0] + a[i][2]);
			op += d[a[i][3]];
		}
	}
	for (int i = 1; i <= n; i ++) {
		if (e[a[i][3]]) continue;
		if (! a[i][0]) {
			if (! a[i][1]) continue;

			op --;
			d[a[i][3]] = std::min(a[i][2] + 1ll, a[i][1]) - 1;
			op += std::min(a[i][2] + 1ll, a[i][1]);
		} else if (! a[i][1]) { // a[i]
			d[a[i][3]] = 0;
			continue;
		}
	}
	std::sort(a.begin() + 1, a.end(), [&](auto x, auto y) {
		return x[3] < y[3];
	});
	for (int i = 1; i <= n; i ++) {
		//if (a[i][0])
		std::cout << a[i][0] + a[i][2] + op - d[i] << ' ';
		/*else 
		std::cout << a[i][2] + op - d[i] << ' '*/
	}
	std::cout << '\n';
	std::cout << sum << '\n';
}
signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	//std::cin >> t;
	while (t --) {
		solve();
	}
	return 0;
}