//  read  in  the  marks
 int  mark;
 while  (std::cin  >>  mark)  {
         int  decile  =  mark  /  10;
         if  (decile  >  9)
                 decile  =  9;
         marks[decile]++;
 }

 //  get  maximum  decile  count
 max_len  =  find_max(marks);