import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author SimplyDivine
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        }

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.StringTokenizer; StringTokenizer java.util import java.io.IOException; IOException java.io import java.io.BufferedReader; BufferedReader java.io import java.io.InputStreamReader; InputStreamReader java.io import java.io.InputStream; InputStream java.io public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        }

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out FastReader in = new FastReader(inputStream); in new FastReader(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskC solver = new TaskC(); solver new TaskC() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskC {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        }

    } TaskC public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        } solve {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int ratings[] = new int[n]; ratings new int[n] n for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                ratings[i] = in.nextInt();
            } {
                ratings[i] = in.nextInt();
            } ratings[i] = in.nextInt() ratings[i] ratings i in.nextInt() in.nextInt in int[] colors = new int[9]; colors new int[9] 9 boolean visited = false; visited false for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            } {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            } if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] <= 399 ratings[i] ratings i 399 {
                    colors[0]++;
                    visited = true;
                } colors[0]++ colors[0] colors 0 visited = true visited true if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] <= 799 ratings[i] ratings i 799 {
                    colors[1]++;
                    visited = true;
                } colors[1]++ colors[1] colors 1 visited = true visited true if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] < 1200 ratings[i] ratings i 1200 {
                    colors[2]++;
                    visited = true;
                } colors[2]++ colors[2] colors 2 visited = true visited true if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] < 1600 ratings[i] ratings i 1600 {
                    colors[3]++;
                    visited = true;
                } colors[3]++ colors[3] colors 3 visited = true visited true if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] < 2000 ratings[i] ratings i 2000 {
                    colors[4]++;
                    visited = true;
                } colors[4]++ colors[4] colors 4 visited = true visited true if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] < 2400 ratings[i] ratings i 2400 {
                    colors[5]++;
                    visited = true;
                } colors[5]++ colors[5] colors 5 visited = true visited true if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] < 2800 ratings[i] ratings i 2800 {
                    colors[6]++;
                    visited = true;
                } colors[6]++ colors[6] colors 6 visited = true visited true if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                } ratings[i] < 3200 ratings[i] ratings i 3200 {
                    colors[7]++;
                    visited = true;
                } colors[7]++ colors[7] colors 7 visited = true visited true {
                    colors[8]++;
                } colors[8]++ colors[8] colors 8 int max = 0; max 0 int min = 0; min 0 for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            } int i = 0; int i = 0; i 0 i < 8 i 8 i++ i++ i {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            } {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            } if (colors[i] > 0) {
                    max++;
                    min++;
                } colors[i] > 0 colors[i] colors i 0 {
                    max++;
                    min++;
                } max++ max min++ min if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            } colors[8] > 0 colors[8] colors 8 0 {
                max += colors[8];
                if (!visited) min = 1;
            } max += colors[8] max colors[8] colors 8 if (!visited) min = 1; !visited visited min = 1 min 1 out.println(min + " " + max) out.println out min + " " + max min + " " + max min " " max int testNumber testNumber FastReader in in PrintWriter out out static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    } FastReader BufferedReader br; br StringTokenizer st; st public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        } FastReader {
            br = new BufferedReader(new
                    InputStreamReader(i));
        } br = new BufferedReader(new
                    InputStreamReader(i)) br new BufferedReader(new
                    InputStreamReader(i)) InputStream i i public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        } next {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        } while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            } st == null || !st.hasMoreElements() st == null st null !st.hasMoreElements() st.hasMoreElements() st.hasMoreElements st {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            } try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                } catch (IOException e) {
                    e.printStackTrace();
                } IOException e {
                    e.printStackTrace();
                } e.printStackTrace() e.printStackTrace e {
                    st = new StringTokenizer(br.readLine());
                } st = new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) return st.nextToken(); st.nextToken() st.nextToken st public int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        }

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        }

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author SimplyDivine
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int ratings[] = new int[n];
            for (int i = 0; i < n; i++) {
                ratings[i] = in.nextInt();
            }
            int[] colors = new int[9];
            boolean visited = false;
            for (int i = 0; i < n; i++) {
                if (ratings[i] <= 399) {
                    colors[0]++;
                    visited = true;
                } else if (ratings[i] <= 799) {
                    colors[1]++;
                    visited = true;
                } else if (ratings[i] < 1200) {
                    colors[2]++;
                    visited = true;
                } else if (ratings[i] < 1600) {
                    colors[3]++;
                    visited = true;
                } else if (ratings[i] < 2000) {
                    colors[4]++;
                    visited = true;
                } else if (ratings[i] < 2400) {
                    colors[5]++;
                    visited = true;
                } else if (ratings[i] < 2800) {
                    colors[6]++;
                    visited = true;
                } else if (ratings[i] < 3200) {
                    colors[7]++;
                    visited = true;
                } else {
                    colors[8]++;
                }
            }
            int max = 0;
            int min = 0;
//        System.out.println(Arrays.toString(colors));
            for (int i = 0; i < 8; i++) {
                if (colors[i] > 0) {
                    max++;
                    min++;
                }
            }
            if (colors[8] > 0) {
                max += colors[8];
                if (!visited) min = 1;
            }
            out.println(min + " " + max);
        }

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream i) {
            br = new BufferedReader(new
                    InputStreamReader(i));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

