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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Data.List (nub, sort)

main :: IO ()
main = do
    n <- readLn
    as <- (map read . words) <$> getLine
    putStrLn $ solve n as

-- |
--
-- >>> solve 4 [2100,2500,2700,2700]
-- "2 2"
--
-- >>> solve 5 [1100,1900,2800,3200,3200]
-- "3 5"
--
-- >>> solve 20 [800,810,820,830,840,850,860,870,880,890,900,910,920,930,940,950,960,970,980,990]
-- "1 1"
solve :: Int -> [Int] -> String
solve n as = show k_min ++ " " ++  show k_max
  where
    as_lower = takeWhile (< 3200) $ sort as
    n_lower = length as_lower
    n_upper = n - n_lower
    k_min' = length . nub . map (`div` 400) $ as_lower
    k_min = if k_min' == 0 then 1 else k_min'
    k_max = if k_min' == 0 then n_upper else k_min' + n_upper