J=lambda:map(int,input().split())
N,*_=J()
A=sorted(J())
def s(l,r,i):L=r-l+1;i[1]=l+L//2;i[0]=i[1]-1+L%2;return(A[i[0]]+A[i[1]])/2
Q=[0]*4
i=[[0,0]for n in range(4)]
Q[2]=s(0,N-1,i[2])
Q[1]=s(0,i[2][0]-(i[2][0]==i[2][1]),i[1])
Q[3]=s(i[2][1]+(i[2][0]==i[2][1]),N-1,i[3])
d=1.5*(Q[3]-Q[1])
print(*Q[1:4],sum(1 for a in A if a<Q[1]-d or Q[3]+d<a))