#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define int long long

signed main(){
	int N;cin>>N;

	vector<pair<int,int>> A(N);
	for(int i=0;i<N;i++){
		int x;cin>>x;
		A[i]={x,i};
	}
	sort(A.begin(),A.end());

	vector<int> B(N-1);
	for(auto&&e:B)cin>>e;
	sort(B.begin(),B.end());

	vector<int> sm1={0},sm2={0};
	for(int i=0;i<N-1;i++){
		sm1.push_back(sm1.back()+abs(A[i].first-B[i]));
		sm2.push_back(sm2.back()+abs(A[i+1].first-B[i]));
	}

	int ans=1e18;
	for(int i=0;i<N;i++){
		ans=min(ans,sm1[i]+sm2.back()-sm2[i]);
	}

	set<int> vec={};
	for(int i=0;i<N;i++){
		if(ans==sm1[i]+sm2.back()-sm2[i]){
			vec.insert(A[i].first);
		}
	}

	cout<<ans<<endl;
	for(auto&&e:vec)cout<<e<<endl;
}