UVA_10057_A_midnight_summer_dream

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

vector <int> v;
int main() {
    int aux,n;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++){
            scanf("%d",&aux);
            v.push_back(aux);
        }
        sort(v.begin(),v.end());
        if(n%2!=0){
            int A=v[n/2];int cont=0;
            for(int i=0;i<n;i++){
                if(v[i]==A) cont++;
                if(v[i]>A) break;
            }
            printf("%d %d 1\n",A,cont);
        }else{
            int A=min(v[n/2],v[(n/2)-1]);int cont=0;
            int B=max(v[n/2],v[(n/2)-1]);
            for (int j=A;j<=B;j++){
              for(int i=0;i<n;i++){
                if(v[i]==j) cont++;
                if(v[i]>j) break;
               }
            }
            printf("%d %d %d\n",A,cont,(B-A)+1);
        }
        v.clear();
    }
    return 0;
}