跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2210. Towers

  • ID: 2216
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 排序
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Towers

题目描述

A. Towers
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.

Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.

Input

The first line contains an integer N (1≤N≤1000) − the number of bars at Vasya’s disposal. The second line contains N space-separated integers li − the lengths of the bars. All the lengths are natural numbers not exceeding 1000.

Output

In one line output two numbers − the height of the largest tower and their total number. Remember that Vasya should use all the bars.

Examples
Input
3
1 2 3
Output
1 3
Input
4
6 5 6 7
Output
2 3

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1816 题。保留原作者与原赛事署名。