import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.*;

public class Main {

static int mod=(int)1e9+7;
 public static void main(String[] $) {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
}
static long pow(long x,long y) {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
}
}
class pair{
  int x,y;
  pair(int x,int y){
    this.x=x;
    this.y=y;
  }
} import java.io.PrintWriter; PrintWriter java.io import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util import java.util.*; util.* java public class Main {

static int mod=(int)1e9+7;
 public static void main(String[] $) {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
}
static long pow(long x,long y) {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
}
} Main static int mod=(int)1e9+7; mod (int)1e9+7 (int)1e9 7 public static void main(String[] $) {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
} main {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
} Scanner sc=new Scanner(System.in); sc new Scanner(System.in) try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  } catch(Exception e) {
    return;
  } Exception e {
    return;
  } return; {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  } int n=sc.nextInt(); n sc.nextInt() sc.nextInt sc int a[]=new int[n]; a new int[n] n for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    } int i=0; int i=0; i 0 i<n i n i++ i++ i {
      a[i]=sc.nextInt();
    } {
      a[i]=sc.nextInt();
    } a[i]=sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc ArrayList<pair> al=new ArrayList<>(); al new ArrayList<>() int x=1; x 1 int y=399; y 399 pair p=new pair(x,y); p new pair(x,y) al.add(p) al.add al p for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    } int i=1; int i=1; i 1 i<8 i 8 i++ i++ i {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    } {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    } x=y+1 x y+1 y 1 y=y+400 y y+400 y 400 pair pp=new pair(x,y); pp new pair(x,y) al.add(pp) al.add al pp int count=0; count 0 int special=0; special 0 HashSet<Integer> aa=new HashSet<>(); aa new HashSet<>() for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    } int i=0; int i=0; i 0 i<n i n i++ i++ i {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    } {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    } if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      } a[i]<3200 a[i] a i 3200 {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      } for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        } pair j al {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        } {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        } if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          } j.x<=a[i]&&j.y>=a[i] j.x<=a[i] j.x j j.x a[i] a i j.y>=a[i] j.y j j.y a[i] a i {
            aa.add(j.y);
          } aa.add(j.y) aa.add aa j.y j j.y {
        special++;
      } special++ special if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special)); special==n special n {
      System.out.println(1+" "+(aa.size()+special));
    } System.out.println(1+" "+(aa.size()+special)) System.out.println System.out System System.out 1+" "+(aa.size()+special) 1+" "+(aa.size()+special) 1 " " (aa.size()+special) aa.size() aa.size aa special System.out.println(aa.size()+" "+(aa.size()+special)) System.out.println System.out System System.out aa.size()+" "+(aa.size()+special) aa.size()+" "+(aa.size()+special) aa.size() aa.size aa " " (aa.size()+special) aa.size() aa.size aa special String[] $ $ static long pow(long x,long y) {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
} pow {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
} long res=1l; res 1l while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  } y!=0 y 0 {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  } if(y%2==1) {
      res=x*res%mod;
    } y%2==1 y%2 y 2 1 {
      res=x*res%mod;
    } res=x*res%mod res x*res%mod x*res x res mod y/=2 y 2 x=x*x%mod x x*x%mod x*x x x mod return res; res long x x long y y class pair{
  int x,y;
  pair(int x,int y){
    this.x=x;
    this.y=y;
  }
} pair 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 public class Main {

static int mod=(int)1e9+7;
 public static void main(String[] $) {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
}
static long pow(long x,long y) {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
}
} public class Main {

static int mod=(int)1e9+7;
 public static void main(String[] $) {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
}
static long pow(long x,long y) {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
}
} Main
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.*;

public class Main {

static int mod=(int)1e9+7;
 public static void main(String[] $) {

  Scanner sc=new Scanner(System.in);
  try {
    
    int n=sc.nextInt();
    int a[]=new int[n];
    for(int i=0;i<n;i++) {
      a[i]=sc.nextInt();
    }
    ArrayList<pair> al=new ArrayList<>();
    int x=1;
    int y=399;
    pair p=new pair(x,y);
    al.add(p);
    for(int i=1;i<8;i++) {
      x=y+1;
      y=y+400;
      pair pp=new pair(x,y);
      al.add(pp);
    }
  
    int count=0;
    int special=0;
    HashSet<Integer> aa=new HashSet<>();
    for(int i=0;i<n;i++) {
      if(a[i]<3200) {
        for(pair j:al) {
          if(j.x<=a[i]&&j.y>=a[i]) {
            aa.add(j.y);
          }
        }
      }else {
        special++;
      }
    }
    if(special==n) {
      System.out.println(1+" "+(aa.size()+special));
    }else
    System.out.println(aa.size()+" "+(aa.size()+special));
 
    
  }catch(Exception e) {
    return;
  }
  
}
static long pow(long x,long y) {
  long res=1l;
  while(y!=0) {
    if(y%2==1) {
      res=x*res%mod;
    }
    y/=2;
    x=x*x%mod;
  }
  return res;
}
}
class pair{
  int x,y;
  pair(int x,int y){
    this.x=x;
    this.y=y;
  }
}