import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


class Main {

	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		Set<BigInteger> set=new HashSet<BigInteger>();
		int c=0;
		int n=scan.nextInt();
		for(int i=1;i<=n;i++)
		{	
			set.add(scan.nextBigInteger());
		}
		
		ArrayList<BigInteger> bi=new ArrayList<BigInteger>(set);
		
		
		int m=set.size();
		for(int i=0;i<m;i++)
		{
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		}
		System.out.println(c);
		bi.clear();
		set.clear();

	}

} import java.math.BigInteger; BigInteger java.math import java.util.ArrayList; ArrayList java.util import java.util.HashSet; HashSet java.util import java.util.Scanner; Scanner java.util import java.util.Set; Set java.util class Main {

	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		Set<BigInteger> set=new HashSet<BigInteger>();
		int c=0;
		int n=scan.nextInt();
		for(int i=1;i<=n;i++)
		{	
			set.add(scan.nextBigInteger());
		}
		
		ArrayList<BigInteger> bi=new ArrayList<BigInteger>(set);
		
		
		int m=set.size();
		for(int i=0;i<m;i++)
		{
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		}
		System.out.println(c);
		bi.clear();
		set.clear();

	}

} Main public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		Set<BigInteger> set=new HashSet<BigInteger>();
		int c=0;
		int n=scan.nextInt();
		for(int i=1;i<=n;i++)
		{	
			set.add(scan.nextBigInteger());
		}
		
		ArrayList<BigInteger> bi=new ArrayList<BigInteger>(set);
		
		
		int m=set.size();
		for(int i=0;i<m;i++)
		{
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		}
		System.out.println(c);
		bi.clear();
		set.clear();

	} main {
		Scanner scan=new Scanner(System.in);
		Set<BigInteger> set=new HashSet<BigInteger>();
		int c=0;
		int n=scan.nextInt();
		for(int i=1;i<=n;i++)
		{	
			set.add(scan.nextBigInteger());
		}
		
		ArrayList<BigInteger> bi=new ArrayList<BigInteger>(set);
		
		
		int m=set.size();
		for(int i=0;i<m;i++)
		{
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		}
		System.out.println(c);
		bi.clear();
		set.clear();

	} Scanner scan=new Scanner(System.in); scan new Scanner(System.in) Set<BigInteger> set=new HashSet<BigInteger>(); set new HashSet<BigInteger>() int c=0; c 0 int n=scan.nextInt(); n scan.nextInt() scan.nextInt scan for(int i=1;i<=n;i++)
		{	
			set.add(scan.nextBigInteger());
		} int i=1; int i=1; i 1 i<=n i n i++ i++ i {	
			set.add(scan.nextBigInteger());
		} {	
			set.add(scan.nextBigInteger());
		} set.add(scan.nextBigInteger()) set.add set scan.nextBigInteger() scan.nextBigInteger scan ArrayList<BigInteger> bi=new ArrayList<BigInteger>(set); bi new ArrayList<BigInteger>(set) int m=set.size(); m set.size() set.size set for(int i=0;i<m;i++)
		{
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		} int i=0; int i=0; i 0 i<m i m i++ i++ i {
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		} {
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		} if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			} bi.get(i).isProbablePrime(10)==true bi.get(i).isProbablePrime(10) bi.get(i).isProbablePrime bi.get(i) bi.get bi i 10 true {
				c++;
			} c++ c System.out.println(c) System.out.println System.out System System.out c bi.clear() bi.clear bi set.clear() set.clear set String[] args args
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


class Main {

	public static void main(String[] args) {
		Scanner scan=new Scanner(System.in);
		Set<BigInteger> set=new HashSet<BigInteger>();
		int c=0;
		int n=scan.nextInt();
		for(int i=1;i<=n;i++)
		{	
			set.add(scan.nextBigInteger());
		}
		
		ArrayList<BigInteger> bi=new ArrayList<BigInteger>(set);
		
		
		int m=set.size();
		for(int i=0;i<m;i++)
		{
			if(bi.get(i).isProbablePrime(10)==true)
			{
				c++;
			}
		}
		System.out.println(c);
		bi.clear();
		set.clear();

	}

}