import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;


public class Main {
    final static int mod=1_000_000_000+7;
    public static void main(String[] args) {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    }

    public static void put(Object object) {
        System.out.println(object);
    }
    public static String format(String string, Object... args) {
        return String.format(string, args);
    }
}

final class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}

final class Pair {
    final public int x, y;

    Pair(int x, int y) {
        this.x = x;
        this.y = y;
    }

    @Override
    public int hashCode() {
        return x+y;
    }

    @Override
    public boolean equals(Object obj) {
        boolean result=super.equals(obj);
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Pair pair=(Pair)obj;
        if(this.x==pair.x&&this.y==pair.y) return true;
        return false;
    }

    @Override
    public String toString() {
        return String.format("(%d,%d)", x, y);
    }
}
final class Tuple<T,V>{
    final public T t;
    final public V v;
    Tuple(T t,V v){
        this.t=t;
        this.v=v;
    }

    @Override
    public int hashCode() {
        return (t.hashCode()+v.hashCode());
    }

    @Override
    public boolean equals(Object obj) {
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Tuple<T,V> tuple=(Tuple)obj;
        return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
    }

    @Override
    public String toString() {
        return String.format("<Tuple>=<%s,%s>",t,v);
    }
}
final class LowerBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T>
{
    public int compare(T x, T y)
    {
        return (x.compareTo(y) >= 0) ? 1 : -1;
    }
}

final class UpperBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T>
{
    public int compare(T x, T y)
    {
        return (x.compareTo(y) > 0) ? 1 : -1;
    }
}

final class Util {
    static long gcd(long a,long b){
        if(a%b==0)return b;
        return gcd(b,a%b);
    }
    static long lcm(long a,long b){
        long gcd=gcd(a,b);
        long result=b/gcd;
        return a*result;
    }
    static int kaijoMod(int n,int mod){
        if(n<1) return -1;
        long result=1;
        for(int i=n;i>1;i--){
            result*=i;
            result%=mod;
        }
        return (int)result;
    }
    static <T extends Comparable> Map<T,Integer> count(List<T> list){
        Collections.sort(list);
        Map<T,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<list.size()){
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        }
        return result;

    }
    static Map<Integer,Integer> count(int[] array){
        Arrays.sort(array);
        Map<Integer,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<array.length){
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        }
        return result;
    }
} import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.lang.reflect.Array; Array java.lang.reflect import java.util.*; util.* java public class Main {
    final static int mod=1_000_000_000+7;
    public static void main(String[] args) {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    }

    public static void put(Object object) {
        System.out.println(object);
    }
    public static String format(String string, Object... args) {
        return String.format(string, args);
    }
} Main final static int mod=1_000_000_000+7; mod 1_000_000_000+7 1_000_000_000 7 public static void main(String[] args) {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    } main {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    } Scanner scanner = new Scanner(); scanner new Scanner() int n=scanner.nextInt(); n scanner.nextInt() scanner.nextInt scanner int[] array=new int[n]; array new int[n] n for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        } {
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        } int a=scanner.nextInt(); a scanner.nextInt() scanner.nextInt scanner if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<400 a 400 {
                a=0;
            } a=0 a 0 if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<800 a 800 {
                a=1;
            } a=1 a 1 if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<800 a 800 {
                a=2;
            } a=2 a 2 if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<1200 a 1200 {
                a=3;
            } a=3 a 3 if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<1600 a 1600 {
                a=4;
            } a=4 a 4 if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<2000 a 2000 {
                a=5;
            } a=5 a 5 if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<2400 a 2400 {
                a=6;
            } a=6 a 6 if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            } a<2800 a 2800 {
                a=7;
            } a=7 a 7 if(a<3200){
                a=8;
            }else{
                a=9;
            } a<3200 a 3200 {
                a=8;
            } a=8 a 8 {
                a=9;
            } a=9 a 9 array[i]=a array[i] array i a Map<Integer,Integer> countMap=Util.count(array); countMap Util.count(array) Util.count Util array if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        } !countMap.containsKey(9) countMap.containsKey(9) countMap.containsKey countMap 9 {
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        } put(format("%d %d",countMap.size(),countMap.size())) put format("%d %d",countMap.size(),countMap.size()) format "%d %d" countMap.size() countMap.size countMap countMap.size() countMap.size countMap return; if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        } countMap.get(9)==n countMap.get(9) countMap.get countMap 9 n {
            put(format("%d %d",1,n));
            return;
        } put(format("%d %d",1,n)) put format("%d %d",1,n) format "%d %d" 1 n return; put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9))) put format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)) format "%d %d" countMap.size()-1 countMap.size() countMap.size countMap 1 countMap.size()-1+countMap.get(9) countMap.size()-1 countMap.size() countMap.size countMap 1 countMap.get(9) countMap.get countMap 9 String[] args args public static void put(Object object) {
        System.out.println(object);
    } put {
        System.out.println(object);
    } System.out.println(object) System.out.println System.out System System.out object Object object object public static String format(String string, Object... args) {
        return String.format(string, args);
    } format {
        return String.format(string, args);
    } return String.format(string, args); String.format(string, args) String.format String string args String string string Object... args args final class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
} Scanner private final InputStream in = System.in; in System.in System System.in private final byte[] buffer = new byte[1024]; buffer new byte[1024] 1024 private int ptr = 0; ptr 0 private int buflen = 0; buflen 0 private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    } hasNextByte {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    } if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        } ptr < buflen ptr buflen {
            return true;
        } return true; true {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        } ptr = 0 ptr 0 try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            } catch (IOException e) {
                e.printStackTrace();
            } IOException e {
                e.printStackTrace();
            } e.printStackTrace() e.printStackTrace e {
                buflen = in.read(buffer);
            } buflen = in.read(buffer) buflen in.read(buffer) in.read in buffer if (buflen <= 0) {
                return false;
            } buflen <= 0 buflen 0 {
                return false;
            } return false; false return true; true private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    } readByte {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    } if (hasNextByte())
            return buffer[ptr++];
        else
            return -1; hasNextByte() hasNextByte return buffer[ptr++]; buffer[ptr++] buffer ptr++ ptr return -1; -1 1 private boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    } isPrintableChar {
        return 33 <= c && c <= 126;
    } return 33 <= c && c <= 126; 33 <= c && c <= 126 33 <= c 33 c c <= 126 c 126 int c c public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    } hasNext {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    } while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++; hasNextByte() && !isPrintableChar(buffer[ptr]) hasNextByte() hasNextByte !isPrintableChar(buffer[ptr]) isPrintableChar(buffer[ptr]) isPrintableChar buffer[ptr] buffer ptr ptr++ ptr return hasNextByte(); hasNextByte() hasNextByte public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    } next {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    } if (!hasNext())
            throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() StringBuilder sb = new StringBuilder(); sb new StringBuilder() int b = readByte(); b readByte() readByte while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        } isPrintableChar(b) isPrintableChar b {
            sb.appendCodePoint(b);
            b = readByte();
        } sb.appendCodePoint(b) sb.appendCodePoint sb b b = readByte() b readByte() readByte return sb.toString(); sb.toString() sb.toString sb public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    } nextLong {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    } if (!hasNext())
            throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() long n = 0; n 0 boolean minus = false; minus false int b = readByte(); b readByte() readByte if (b == '-') {
            minus = true;
            b = readByte();
        } b == '-' b '-' {
            minus = true;
            b = readByte();
        } minus = true minus true b = readByte() b readByte() readByte if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        } b < '0' || '9' < b b < '0' b '0' '9' < b '9' b {
            throw new NumberFormatException();
        } throw new NumberFormatException(); new NumberFormatException() while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        } true {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        } if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            } '0' <= b && b <= '9' '0' <= b '0' b b <= '9' b '9' {
                n *= 10;
                n += b - '0';
            } n *= 10 n 10 n += b - '0' n b - '0' b '0' if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            } b == -1 || !isPrintableChar(b) b == -1 b -1 1 !isPrintableChar(b) isPrintableChar(b) isPrintableChar b {
                return minus ? -n : n;
            } return minus ? -n : n; minus ? -n : n minus -n n n {
                throw new NumberFormatException();
            } throw new NumberFormatException(); new NumberFormatException() b = readByte() b readByte() readByte public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    } nextInt {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    } long nl = nextLong(); nl nextLong() nextLong if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException(); nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE nl < Integer.MIN_VALUE nl Integer.MIN_VALUE Integer Integer.MIN_VALUE nl > Integer.MAX_VALUE nl Integer.MAX_VALUE Integer Integer.MAX_VALUE throw new NumberFormatException(); new NumberFormatException() return (int) nl; (int) nl public double nextDouble() {
        return Double.parseDouble(next());
    } nextDouble {
        return Double.parseDouble(next());
    } return Double.parseDouble(next()); Double.parseDouble(next()) Double.parseDouble Double next() next final class Pair {
    final public int x, y;

    Pair(int x, int y) {
        this.x = x;
        this.y = y;
    }

    @Override
    public int hashCode() {
        return x+y;
    }

    @Override
    public boolean equals(Object obj) {
        boolean result=super.equals(obj);
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Pair pair=(Pair)obj;
        if(this.x==pair.x&&this.y==pair.y) return true;
        return false;
    }

    @Override
    public String toString() {
        return String.format("(%d,%d)", x, y);
    }
} Pair final public int x x y; y Pair(int x, int y) {
        this.x = x;
        this.y = y;
    } Pair {
        this.x = x;
        this.y = y;
    } this.x = x this.x this this.x x this.y = y this.y this this.y y int x x int y y @Override
    public int hashCode() {
        return x+y;
    } hashCode {
        return x+y;
    } return x+y; x+y x y @Override
    public boolean equals(Object obj) {
        boolean result=super.equals(obj);
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Pair pair=(Pair)obj;
        if(this.x==pair.x&&this.y==pair.y) return true;
        return false;
    } equals {
        boolean result=super.equals(obj);
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Pair pair=(Pair)obj;
        if(this.x==pair.x&&this.y==pair.y) return true;
        return false;
    } boolean result=super.equals(obj); result super.equals(obj) super.equals super obj if(obj.getClass()!=this.getClass()){
            return false;
        } obj.getClass()!=this.getClass() obj.getClass() obj.getClass obj this.getClass() this.getClass this {
            return false;
        } return false; false Pair pair=(Pair)obj; pair (Pair)obj if(this.x==pair.x&&this.y==pair.y) return true; this.x==pair.x&&this.y==pair.y this.x==pair.x this.x this this.x pair.x pair pair.x this.y==pair.y this.y this this.y pair.y pair pair.y return true; true return false; false Object obj obj @Override
    public String toString() {
        return String.format("(%d,%d)", x, y);
    } toString {
        return String.format("(%d,%d)", x, y);
    } return String.format("(%d,%d)", x, y); String.format("(%d,%d)", x, y) String.format String "(%d,%d)" x y final class Tuple<T,V>{
    final public T t;
    final public V v;
    Tuple(T t,V v){
        this.t=t;
        this.v=v;
    }

    @Override
    public int hashCode() {
        return (t.hashCode()+v.hashCode());
    }

    @Override
    public boolean equals(Object obj) {
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Tuple<T,V> tuple=(Tuple)obj;
        return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
    }

    @Override
    public String toString() {
        return String.format("<Tuple>=<%s,%s>",t,v);
    }
} Tuple final public T t; t final public V v; v Tuple(T t,V v){
        this.t=t;
        this.v=v;
    } Tuple {
        this.t=t;
        this.v=v;
    } this.t=t this.t this this.t t this.v=v this.v this this.v v T t t V v v @Override
    public int hashCode() {
        return (t.hashCode()+v.hashCode());
    } hashCode {
        return (t.hashCode()+v.hashCode());
    } return (t.hashCode()+v.hashCode()); (t.hashCode()+v.hashCode()) t.hashCode() t.hashCode t v.hashCode() v.hashCode v @Override
    public boolean equals(Object obj) {
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Tuple<T,V> tuple=(Tuple)obj;
        return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
    } equals {
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Tuple<T,V> tuple=(Tuple)obj;
        return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
    } if(obj.getClass()!=this.getClass()){
            return false;
        } obj.getClass()!=this.getClass() obj.getClass() obj.getClass obj this.getClass() this.getClass this {
            return false;
        } return false; false Tuple<T,V> tuple=(Tuple)obj; tuple (Tuple)obj return tuple.t.equals(this.t)&&tuple.v.equals(this.v); tuple.t.equals(this.t)&&tuple.v.equals(this.v) tuple.t.equals(this.t) tuple.t.equals tuple.t tuple tuple.t this.t this this.t tuple.v.equals(this.v) tuple.v.equals tuple.v tuple tuple.v this.v this this.v Object obj obj @Override
    public String toString() {
        return String.format("<Tuple>=<%s,%s>",t,v);
    } toString {
        return String.format("<Tuple>=<%s,%s>",t,v);
    } return String.format("<Tuple>=<%s,%s>",t,v); String.format("<Tuple>=<%s,%s>",t,v) String.format String "<Tuple>=<%s,%s>" t v final class LowerBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T>
{
    public int compare(T x, T y)
    {
        return (x.compareTo(y) >= 0) ? 1 : -1;
    }
} LowerBoundComparator public int compare(T x, T y)
    {
        return (x.compareTo(y) >= 0) ? 1 : -1;
    } compare {
        return (x.compareTo(y) >= 0) ? 1 : -1;
    } return (x.compareTo(y) >= 0) ? 1 : -1; (x.compareTo(y) >= 0) ? 1 : -1 (x.compareTo(y) >= 0) x.compareTo(y) x.compareTo x y 0 1 -1 1 T x x T y y Comparator final class UpperBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T>
{
    public int compare(T x, T y)
    {
        return (x.compareTo(y) > 0) ? 1 : -1;
    }
} UpperBoundComparator public int compare(T x, T y)
    {
        return (x.compareTo(y) > 0) ? 1 : -1;
    } compare {
        return (x.compareTo(y) > 0) ? 1 : -1;
    } return (x.compareTo(y) > 0) ? 1 : -1; (x.compareTo(y) > 0) ? 1 : -1 (x.compareTo(y) > 0) x.compareTo(y) x.compareTo x y 0 1 -1 1 T x x T y y Comparator final class Util {
    static long gcd(long a,long b){
        if(a%b==0)return b;
        return gcd(b,a%b);
    }
    static long lcm(long a,long b){
        long gcd=gcd(a,b);
        long result=b/gcd;
        return a*result;
    }
    static int kaijoMod(int n,int mod){
        if(n<1) return -1;
        long result=1;
        for(int i=n;i>1;i--){
            result*=i;
            result%=mod;
        }
        return (int)result;
    }
    static <T extends Comparable> Map<T,Integer> count(List<T> list){
        Collections.sort(list);
        Map<T,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<list.size()){
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        }
        return result;

    }
    static Map<Integer,Integer> count(int[] array){
        Arrays.sort(array);
        Map<Integer,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<array.length){
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        }
        return result;
    }
} Util static long gcd(long a,long b){
        if(a%b==0)return b;
        return gcd(b,a%b);
    } gcd {
        if(a%b==0)return b;
        return gcd(b,a%b);
    } if(a%b==0)return b; a%b==0 a%b a b 0 return b; b return gcd(b,a%b); gcd(b,a%b) gcd b a%b a b long a a long b b static long lcm(long a,long b){
        long gcd=gcd(a,b);
        long result=b/gcd;
        return a*result;
    } lcm {
        long gcd=gcd(a,b);
        long result=b/gcd;
        return a*result;
    } long gcd=gcd(a,b); gcd gcd(a,b) gcd a b long result=b/gcd; result b/gcd b gcd return a*result; a*result a result long a a long b b static int kaijoMod(int n,int mod){
        if(n<1) return -1;
        long result=1;
        for(int i=n;i>1;i--){
            result*=i;
            result%=mod;
        }
        return (int)result;
    } kaijoMod {
        if(n<1) return -1;
        long result=1;
        for(int i=n;i>1;i--){
            result*=i;
            result%=mod;
        }
        return (int)result;
    } if(n<1) return -1; n<1 n 1 return -1; -1 1 long result=1; result 1 for(int i=n;i>1;i--){
            result*=i;
            result%=mod;
        } int i=n; int i=n; i n i>1 i 1 i-- i-- i {
            result*=i;
            result%=mod;
        } {
            result*=i;
            result%=mod;
        } result*=i result i result%=mod result mod return (int)result; (int)result int n n int mod mod static <T extends Comparable> Map<T,Integer> count(List<T> list){
        Collections.sort(list);
        Map<T,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<list.size()){
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        }
        return result;

    } count {
        Collections.sort(list);
        Map<T,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<list.size()){
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        }
        return result;

    } Collections.sort(list) Collections.sort Collections list Map<T,Integer> result=new HashMap<>(); result new HashMap<>() int l=0 l 0 r=0; r 0 while(l<list.size()){
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        } l<list.size() l list.size() list.size list {
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        } while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            } r<list.size()-1&&list.get(r).equals(r+1) r<list.size()-1 r list.size()-1 list.size() list.size list 1 list.get(r).equals(r+1) list.get(r).equals list.get(r) list.get list r r+1 r 1 {
                r++;
            } r++ r result.put(list.get(r),r-l+1) result.put result list.get(r) list.get list r r-l+1 r-l r l 1 r++ r l=r l r return result; result List<T> list list static Map<Integer,Integer> count(int[] array){
        Arrays.sort(array);
        Map<Integer,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<array.length){
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        }
        return result;
    } count {
        Arrays.sort(array);
        Map<Integer,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<array.length){
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        }
        return result;
    } Arrays.sort(array) Arrays.sort Arrays array Map<Integer,Integer> result=new HashMap<>(); result new HashMap<>() int l=0 l 0 r=0; r 0 while(l<array.length){
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        } l<array.length l array.length array array.length {
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        } while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            } r<array.length-1&&array[r]==array[r+1] r<array.length-1 r array.length-1 array.length array array.length 1 array[r]==array[r+1] array[r] array r array[r+1] array r+1 r 1 {
                r++;
            } r++ r result.put(array[l],r-l+1) result.put result array[l] array l r-l+1 r-l r l 1 r++ r l=r l r return result; result int[] array array public class Main {
    final static int mod=1_000_000_000+7;
    public static void main(String[] args) {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    }

    public static void put(Object object) {
        System.out.println(object);
    }
    public static String format(String string, Object... args) {
        return String.format(string, args);
    }
} public class Main {
    final static int mod=1_000_000_000+7;
    public static void main(String[] args) {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    }

    public static void put(Object object) {
        System.out.println(object);
    }
    public static String format(String string, Object... args) {
        return String.format(string, args);
    }
} Main
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;


public class Main {
    final static int mod=1_000_000_000+7;
    public static void main(String[] args) {
        Scanner scanner = new Scanner();
        int n=scanner.nextInt();
        int[] array=new int[n];
        for(int i=0;i<n;i++){
            int a=scanner.nextInt();
            if(a<400){
                a=0;
            }else if(a<800){
                a=1;
            }else if(a<800){
                a=2;
            }else if(a<1200){
                a=3;
            }else if(a<1600){
                a=4;
            }else if(a<2000){
                a=5;
            }else if(a<2400){
                a=6;
            }else if(a<2800){
                a=7;
            }else if(a<3200){
                a=8;
            }else{
                a=9;
            }
            array[i]=a;
        }
        Map<Integer,Integer> countMap=Util.count(array);
        if(!countMap.containsKey(9)){
            put(format("%d %d",countMap.size(),countMap.size()));
            return;
        }
        if(countMap.get(9)==n){
            put(format("%d %d",1,n));
            return;
        }
        put(format("%d %d",countMap.size()-1,countMap.size()-1+countMap.get(9)));




    }

    public static void put(Object object) {
        System.out.println(object);
    }
    public static String format(String string, Object... args) {
        return String.format(string, args);
    }
}

final class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}

final class Pair {
    final public int x, y;

    Pair(int x, int y) {
        this.x = x;
        this.y = y;
    }

    @Override
    public int hashCode() {
        return x+y;
    }

    @Override
    public boolean equals(Object obj) {
        boolean result=super.equals(obj);
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Pair pair=(Pair)obj;
        if(this.x==pair.x&&this.y==pair.y) return true;
        return false;
    }

    @Override
    public String toString() {
        return String.format("(%d,%d)", x, y);
    }
}
final class Tuple<T,V>{
    final public T t;
    final public V v;
    Tuple(T t,V v){
        this.t=t;
        this.v=v;
    }

    @Override
    public int hashCode() {
        return (t.hashCode()+v.hashCode());
    }

    @Override
    public boolean equals(Object obj) {
        if(obj.getClass()!=this.getClass()){
            return false;
        }
        Tuple<T,V> tuple=(Tuple)obj;
        return tuple.t.equals(this.t)&&tuple.v.equals(this.v);
    }

    @Override
    public String toString() {
        return String.format("<Tuple>=<%s,%s>",t,v);
    }
}
final class LowerBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T>
{
    public int compare(T x, T y)
    {
        return (x.compareTo(y) >= 0) ? 1 : -1;
    }
}

final class UpperBoundComparator<T extends Comparable<? super T>>
        implements Comparator<T>
{
    public int compare(T x, T y)
    {
        return (x.compareTo(y) > 0) ? 1 : -1;
    }
}

final class Util {
    static long gcd(long a,long b){
        if(a%b==0)return b;
        return gcd(b,a%b);
    }
    static long lcm(long a,long b){
        long gcd=gcd(a,b);
        long result=b/gcd;
        return a*result;
    }
    static int kaijoMod(int n,int mod){
        if(n<1) return -1;
        long result=1;
        for(int i=n;i>1;i--){
            result*=i;
            result%=mod;
        }
        return (int)result;
    }
    static <T extends Comparable> Map<T,Integer> count(List<T> list){
        Collections.sort(list);
        Map<T,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<list.size()){
            while(r<list.size()-1&&list.get(r).equals(r+1)){
                r++;
            }
            result.put(list.get(r),r-l+1);
            r++;
            l=r;
        }
        return result;

    }
    static Map<Integer,Integer> count(int[] array){
        Arrays.sort(array);
        Map<Integer,Integer> result=new HashMap<>();
        int l=0,r=0;
        while(l<array.length){
            while(r<array.length-1&&array[r]==array[r+1]){
                r++;
            }
            result.put(array[l],r-l+1);
            r++;
            l=r;
        }
        return result;
    }
}
