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.

Examples

Input

4
2100 2500 2700 2700


Output

2 2


Input

5
1100 1900 2800 3200 3200


Output

3 5


Input

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


Output

1 1
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n= sc.nextInt();
		int[] color = new int[9];
		Arrays.fill(color, 0);

		for(int i = 0; i < n; i++) {
			int gt = sc.nextInt();
			if(gt >= 1 && gt <= 399) {
				color[0] = 1;
			} else if(gt >= 400 && gt <= 799) {
				color[1] = 1;
			}  else if(gt >= 800 && gt <= 1199) {
				color[2] = 1;
			}  else if(gt >= 1200 && gt <= 1599) {
				color[3] = 1;
			}  else if(gt >= 1600 && gt <= 1999) {
				color[4] = 1;
			}  else if(gt >= 2000 && gt <= 2399) {
				color[5] = 1;
			}  else if(gt >= 2400 && gt <= 2799) {
				color[6] = 1;
			}  else if(gt >= 2800 && gt <= 3199) {
				color[7] = 1;
			}  else if(gt >= 3200) {
				color[8] += 1;
			}
		}

		int min = 0;


		for(int i = 0; i < color.length - 1; i++) {
			min += color[i];
		}
		int max = min + color[8];

		if(min == 0 && color[8] >= 1) {
			min = 1;
		}

		System.out.println(min + " " + max);
	}

}
