Problem:
Score : 300 points

Problem Statement

In AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:

Rating 1-399 : gray

Rating 400-799 : brown

Rating 800-1199 : green

Rating 1200-1599 : cyan

Rating 1600-1999 : blue

Rating 2000-2399 : yellow

Rating 2400-2799 : orange

Rating 2800-3199 : red

Other than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.

Currently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.

Find the minimum and maximum possible numbers of different colors of the users.

Constraints

1 ≤ N ≤ 100

1 ≤ a_i ≤ 4800

a_i is an integer.

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.

Sample Input 1

4
2100 2500 2700 2700

Sample Output 1

2 2

The user with rating 2100 is "yellow", and the others are "orange". There are two different colors.

Sample Input 2

5
1100 1900 2800 3200 3200

Sample Output 2

3 5

The user with rating 1100 is "green", the user with rating 1900 is blue and the user with rating 2800 is "red".

If the fourth user picks "red", and the fifth user picks "blue", there are three different colors. This is one possible scenario for the minimum number of colors.

If the fourth user picks "purple", and the fifth user picks "black", there are five different colors. This is one possible scenario for the maximum number of colors.

Sample Input 3

20
800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990

Sample Output 3

1 1

All the users are "green", and thus there is one color.

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

# AtCoderでは、コンテストに参加すると「色」が付き、これはレートによって次のように変化します：
# レート 1-399：灰色
# レート 400-799：茶色
# レート 800-1199：緑色
# レート 1200-1599：水色
# レート 1600-1999：青色
# レート 2000-2399：黄色
# レート 2400-2799：橙色
# レート 2800-3199：赤色
# また、レートが 3200 以上になると色を自由に変えることができます。
# 現在 N 人の人がAtCoderのコンテストに参加したことがあり、i 人目の人のレートは ai です。
# そのとき、色の種類数の最小値と最大値を求めなさい。

n = gets.to_i
input_a = gets.chomp.split

a = Array.new
n.times do |i|
    a << input_a[i].to_i
end

def color(rate)
    case rate
    when 1..399
        return "灰色"
    when 400..799
        return "茶色"
    when 800..1199
        return "緑色"
    when 1200..1599
        return "水色"
    when 1600..1999
        return "青色"
    when 2000..2399
        return "黄色"
    when 2400..2799
        return "橙色"
    when 2800..3199
        return "赤色"
    else
        return "自由"
    end
end

a_colors = Array.new
freedom_color_count = 0

a.each do |rate|
    if !a_colors.include?(color(rate))
        a_colors << color(rate)
    end

    if color(rate) == "自由"
        freedom_color_count += 1
    end
end

if freedom_color_count != 0
    max = a_colors.length - 1
    min = a_colors.length - 1
    
    while max < 8 && freedom_color_count > 0
        max += 1
        freedom_color_count -= 1
    end
else
    max = a_colors.length
    min = a_colors.length
end

print min.to_s + " " + max.to_s + "\n"