#include<fstream>
#include<cmath>
#include<algorithm>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int mini,maxi,j,min1,min2,i,k1,k2,p,P,n,a[7],v[1001];
int main()
{f>>n;
for(i=1;i<=n;++i)
	f>>v[i];

mini=10000;
maxi=-100000;
for(i=1;i<=6;++i)
{f>>a[i];
if(a[i]>maxi)
	maxi=a[i],P=i;
if(a[i]<mini)
	mini=a[i],p=i;
}
for(i=1;i<=6;++i)
	for(j=1;j<=n;++j)
		if(a[i]==v[j])
			v[j]=-100000000;
		
min1=4556365;
min2=min1;
for(i=1;i<=n;++i)
	{if(mini!=v[i])
	{if(abs(v[i]-mini)<min1)
		k1=v[i],min1=abs(v[i]-mini);
	else
		if(abs(v[i]-mini)==min1&&v[i]>k1)
			k1=v[i];}
	if(maxi!=v[i])
	{if(abs(v[i]-maxi)<min2)
		k2=v[i],min2=abs(v[i]-maxi);
	else
		if(abs(v[i]-maxi)==min2&&v[i]>k2)
			k2=v[i];
	}}
if(k1==k2)
a[p]=k1;
a[P]=k2;
sort(a+1,a+7);
for(i=1;i<=6;++i)
	g<<a[i]<<' ';
g<<'\n';
return 0;
}