########################################################################
#                                                                      #
#       CCCCCC  SSSSSS  IIIII  RRRRRR   OOOO          L      IIIII     #
#       C       S         I    R    R  O    O         L        I       #
#       C       SSSSSS    I    RRRRRR  O    O  =====  L        I       #
#       C            S    I    R RR    O    O         L        I       #
#       CCCCCC  SSSSSS  IIIII  R   RR   OOOO          LLLLL  IIIII     #
#                                                                      #
#  Program Density                                                     #
#                                                                      #
########################################################################

{ data[NR] = $1 }; \
        END { min = data[1]; \
              max = data[NR]; \
              range = max - min; \
              n_int = 1000; \
              if( int(NR*.1) <= n_int ) n_int = int(NR*.20); \
              n_int = 1000; \
              size = range / n_int; \
              for(i=1; i<=NR; i++){ \
                    tot += data[i]; \
                    aux = int((data[i] - min)/size) + 1; \
                    q[aux]++; \
              }; \
              mn_int = min + size/2; \
              for(i=1; i<=n_int; i++){ \
                    if( q[i] < 1 ) q[i] = 0; \
                    print mn_int, q[i]; \
                    mn_int += size; \
              }; \
        }