#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<int> A(N),B(N-1);
	for(auto&&e:A)cin>>e;
	for(auto&&e:B)cin>>e;

	sort(A.begin(),A.end());
	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]-B[i]));
		sm2.push_back(sm2.back()+abs(A[i+1]-B[i]));
	}

	int ans=1e18;

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

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

	cout<<st.size()<<endl;
	vector<int> vec(st.begin(),st.end());
	for(int i=0;i<vec.size();i++){
		if(i)cout<<" ";
		cout<<vec[i];
	}
	cout<<endl;
}