#include using namespace std; long double f(vector v) { int n = v.size(); if(n%2==1) { return v[n/2]; } long double res = v[n/2] + v[(n/2)-1]; res/=2; return res; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int n,t; vector v; cin >> n; for(int i=0;i> t; v.push_back(t); } int m = n/2; sort(v.rbegin(),v.rend()); vector a,b; for(int i=0;i q[2] + (1.5*iqr)) cnt+=1; } cout << fixed; cout.precision(6); cout << q[0] << ' ' << q[1] << ' ' << q[2] << ' ' << cnt << '\n'; return 0; }