#include <algorithm>
int main(){
int dada[100];
int shu;
for(int myi=0;myi<5;myi++){
cin>>shu;
dada[myi]=shu;
}
sort(dada,dada+5);
int min=30;
int tmp1=0;
int tmp2=0;
for(int myk=0;myk<4;myk++){
//for(int myj=myk+1;myj<5;myj++)
int myj=myk+1;
int kk=dada[myj]-dada[myk];
if(kk<min)
{
min=kk;
tmp1=myk;
// tmp2=myj;
}
if(kk==min&&myk>tmp1)
{
tmp1=myk;
}
}
cout<<dada[tmp1]<<" "<<dada[tmp1+1]<<endl;
int main(){
int dada[100];
int shu;
for(int myi=0;myi<5;myi++){
cin>>shu;
dada[myi]=shu;
}
sort(dada,dada+5);
int min=30;
int tmp1=0;
int tmp2=0;
for(int myk=0;myk<4;myk++){
//for(int myj=myk+1;myj<5;myj++)
int myj=myk+1;
int kk=dada[myj]-dada[myk];
if(kk<min)
{
min=kk;
tmp1=myk;
// tmp2=myj;
}
if(kk==min&&myk>tmp1)
{
tmp1=myk;
}
}
cout<<dada[tmp1]<<" "<<dada[tmp1+1]<<endl;