问题描述：给定含有n个元素的多重集合S，每个元素在S中出现的次数称为该元素的重数。多重集S中重数最大的元素称为众数。

★算法设计：对于给定的由n个自然数组成的多重集S，计算S的众数及其重数。

★数据输入：输入数据由文件名为input.txt的文本文件提供。文件的第1行为多重集S中的元素个数n；在接下来的n行中，每行有一个自然数。

★结果输出: 将计算结果输出到文件output.txt。输出文件有2行，第一行是众数，第2行是重数。

-The descr iption of the problem: given multiple collections S containing n elements, the number of occurrences of each element in S is referred to as the number of a weight for the element. Multiple multiplicity of elements in the set S is called the singular. ★ algorithm design: multiset S given by n natural numbers to calculate the number of all its multiplicity of S. ★ Data Input: input data from a text file named input.txt file. File behavior of a multiple number of elements in the set S n　in the next n lines, each line has a natural number. ★ output: the calculation results output to the file output.txt. 2 line in the output file, the first line is plural, the second line is heavy.