import java.util.Scanner;

class Main {
  public static void main(String[] args){
    Scanner nyuryoku = new Scanner(System.in);
    int n = nyuryoku.nextInt();
    int[] num = new int[n];
    for (int i = 0; i < n; i++){
      num[i] = nyuryoku.nextInt();
    }
    int ans = prime(n, num);
    System.out.println(ans);
  }
  public static int prime(int n, int[] num){
    int count = 0;
    IN:for (int i = 0; i < n; i++){
      for (int j = 2; j*j <= num[i];j++)
        if (num[i] % j == 0) {continue IN;}
    count++;
    }
    return count;
  }
} import java.util.Scanner; Scanner java.util class Main {
  public static void main(String[] args){
    Scanner nyuryoku = new Scanner(System.in);
    int n = nyuryoku.nextInt();
    int[] num = new int[n];
    for (int i = 0; i < n; i++){
      num[i] = nyuryoku.nextInt();
    }
    int ans = prime(n, num);
    System.out.println(ans);
  }
  public static int prime(int n, int[] num){
    int count = 0;
    IN:for (int i = 0; i < n; i++){
      for (int j = 2; j*j <= num[i];j++)
        if (num[i] % j == 0) {continue IN;}
    count++;
    }
    return count;
  }
} Main public static void main(String[] args){
    Scanner nyuryoku = new Scanner(System.in);
    int n = nyuryoku.nextInt();
    int[] num = new int[n];
    for (int i = 0; i < n; i++){
      num[i] = nyuryoku.nextInt();
    }
    int ans = prime(n, num);
    System.out.println(ans);
  } main {
    Scanner nyuryoku = new Scanner(System.in);
    int n = nyuryoku.nextInt();
    int[] num = new int[n];
    for (int i = 0; i < n; i++){
      num[i] = nyuryoku.nextInt();
    }
    int ans = prime(n, num);
    System.out.println(ans);
  } Scanner nyuryoku = new Scanner(System.in); nyuryoku new Scanner(System.in) int n = nyuryoku.nextInt(); n nyuryoku.nextInt() nyuryoku.nextInt nyuryoku int[] num = new int[n]; num new int[n] n for (int i = 0; i < n; i++){
      num[i] = nyuryoku.nextInt();
    } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
      num[i] = nyuryoku.nextInt();
    } {
      num[i] = nyuryoku.nextInt();
    } num[i] = nyuryoku.nextInt() num[i] num i nyuryoku.nextInt() nyuryoku.nextInt nyuryoku int ans = prime(n, num); ans prime(n, num) prime n num System.out.println(ans) System.out.println System.out System System.out ans String[] args args public static int prime(int n, int[] num){
    int count = 0;
    IN:for (int i = 0; i < n; i++){
      for (int j = 2; j*j <= num[i];j++)
        if (num[i] % j == 0) {continue IN;}
    count++;
    }
    return count;
  } prime {
    int count = 0;
    IN:for (int i = 0; i < n; i++){
      for (int j = 2; j*j <= num[i];j++)
        if (num[i] % j == 0) {continue IN;}
    count++;
    }
    return count;
  } int count = 0; count 0 return count; count int n n int[] num num
import java.util.Scanner;

class Main {
  public static void main(String[] args){
    Scanner nyuryoku = new Scanner(System.in);
    int n = nyuryoku.nextInt();
    int[] num = new int[n];
    for (int i = 0; i < n; i++){
      num[i] = nyuryoku.nextInt();
    }
    int ans = prime(n, num);
    System.out.println(ans);
  }
  public static int prime(int n, int[] num){
    int count = 0;
    IN:for (int i = 0; i < n; i++){
      for (int j = 2; j*j <= num[i];j++)
        if (num[i] % j == 0) {continue IN;}
    count++;
    }
    return count;
  }
}
