• [1262] Shen

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • Shen is a champion of League of Legends.
    He has a skill - Vorpal Blade. Shen takes out a blade from his ass and throws it to enemy.

    Shen has several kinds of blades. Each kind of blades has the same quantity.
    Now we count the blade type every time Shen has throwed, you should tell us the minimum number of blades Shen probably owns.

  • 输入
  • This problem contains several cases. The first line of each case contains a integer N (0 < N <= 5000), indicates the times Shen throwed the blades.
    Then follow N lines. Each line is an integer T, indicates the type of blade that Shen has throwed at that time. (0 <= T < 50)
  • 输出
  • For each case, you should output the minimum number of blades Shen probably owns.
  • 样例输入
  • 4
    0
    1
    2
    3
    
  • 样例输出
  • 4
    
  • 提示
  • 来源
  • XadillaX
  • 操作

显示春菜