import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author G. Guarnieri
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(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, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        }

        private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        }

    }
}
 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.HashSet; HashSet java.util import java.util.Scanner; Scanner java.util import java.util.Set; Set java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(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, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        }

        private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(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;
        Scanner in = new Scanner(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 Scanner in = new Scanner(inputStream); in new Scanner(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, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        }

        private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        }

    } TaskC public void solve(int testNumber, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        } solve {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        } Set<Integer> colors = new HashSet<>(); colors new HashSet<>() int n = in.nextInt(); n in.nextInt() in.nextInt in int choosers = 0; choosers 0 for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            } {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            } int current = getColor(in.nextInt()); current getColor(in.nextInt()) getColor in.nextInt() in.nextInt in if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                } current < 0 current 0 {
                    ++choosers;
                } ++choosers choosers {
                    colors.add(current);
                } colors.add(current) colors.add colors current out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers) out.printf out "%d %d\n" Math.max(colors.size(), 1) Math.max Math colors.size() colors.size colors 1 colors.size() + choosers colors.size() colors.size colors choosers int testNumber testNumber Scanner in in PrintWriter out out private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        } getColor {
            return score < 3200 ? score / 400 : -1;
        } return score < 3200 ? score / 400 : -1; score < 3200 ? score / 400 : -1 score < 3200 score 3200 score / 400 score 400 -1 1 int score score public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(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, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        }

        private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(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, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        }

        private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author G. Guarnieri
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(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, Scanner in, PrintWriter out) {
        /*
        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
         */
            Set<Integer> colors = new HashSet<>();
            int n = in.nextInt();
            int choosers = 0;
            for (int i = 0; i < n; i++) {
                int current = getColor(in.nextInt());
                if (current < 0) {
                    ++choosers;
                }
                else {
                    colors.add(current);
                }
            }
            out.printf("%d %d\n",
                       Math.max(colors.size(), 1),
                       colors.size() + choosers);
        }

        private int getColor(int score) {
            return score < 3200 ? score / 400 : -1;
        }

    }
}

