import java.util.*;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	}
} import java.util.*; util.* java public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	}
} Main /**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	} main {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	} Scanner s = new Scanner(System.in); s new Scanner(System.in) boolean is_prime = true; is_prime true Integer[] prime_10 = {2, 3, 5, 7}; prime_10 {2, 3, 5, 7} 2 3 5 7 ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10)); prime_100 new ArrayList<Integer>(Arrays.asList(prime_10)) for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		} int i = 10; int i = 10; i 10 i < 100 i 100 i++ i++ i {
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		} {
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		} is_prime = true is_prime true for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			} int j = 0; int j = 0; j 0 j < prime_10.length j prime_10.length prime_10 prime_10.length j++ j++ j {
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			} {
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			} if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				} i %  prime_10[j] == 0 i %  prime_10[j] i prime_10[j] prime_10 j 0 {
					is_prime = false;
					break;
				} is_prime = false is_prime false break; if(is_prime){
				prime_100.add(i);
			} is_prime {
				prime_100.add(i);
			} prime_100.add(i) prime_100.add prime_100 i ArrayList<Integer> prime_10000 = new ArrayList<Integer>(); prime_10000 new ArrayList<Integer>() for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		} int i = 2; int i = 2; i 2 i < 10000 i 10000 i++ i++ i {
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		} {
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		} is_prime = true is_prime true for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			} int j = 0; int j = 0; j 0 j < prime_100.size() j prime_100.size() prime_100.size prime_100 j++ j++ j {
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			} {
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			} Integer prime = prime_100.get(j); prime prime_100.get(j) prime_100.get prime_100 j if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				} i != prime&& i % prime == 0 i != prime i prime i % prime == 0 i % prime i prime 0 {
					is_prime = false;
					break;
				} is_prime = false is_prime false break; if(is_prime){
				prime_10000.add(i);
			} is_prime {
				prime_10000.add(i);
			} prime_10000.add(i) prime_10000.add prime_10000 i ArrayList<Integer> result = new ArrayList<Integer>(); result new ArrayList<Integer>() while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		} s.hasNext() s.hasNext s {
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		} Integer number = Integer.parseInt(s.next()); number Integer.parseInt(s.next()) Integer.parseInt Integer s.next() s.next s is_prime = true is_prime true if(result.contains(number)){
				continue;
			} result.contains(number) result.contains result number {
				continue;
			} continue; for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			} int j = 0; int j = 0; j 0 j < prime_10000.size() j prime_10000.size() prime_10000.size prime_10000 j++ j++ j {
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			} {
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			} Integer prime = prime_10000.get(j); prime prime_10000.get(j) prime_10000.get prime_10000 j if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				} !number.equals(prime) && number % prime == 0 !number.equals(prime) number.equals(prime) number.equals number prime number % prime == 0 number % prime number prime 0 {
					is_prime = false;
					break;
				} is_prime = false is_prime false break; if(is_prime){
				result.add(number);
			} is_prime {
				result.add(number);
			} result.add(number) result.add result number System.out.println(result.size()) System.out.println System.out System System.out result.size() result.size result s.close() s.close s String[] args args public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	}
} public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	}
} Main
import java.util.*;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean is_prime = true;
		Integer[] prime_10 = {2, 3, 5, 7};
		ArrayList<Integer> prime_100 = new ArrayList<Integer>(Arrays.asList(prime_10));
		for(int i = 10; i < 100; i++){
			is_prime = true;
			for(int j = 0; j < prime_10.length; j++){
				if(i %  prime_10[j] == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_100.add(i);
			}
		}

		ArrayList<Integer> prime_10000 = new ArrayList<Integer>();
		for(int i = 2; i < 10000; i++){
			is_prime = true;
			for(int j = 0; j < prime_100.size(); j++){
				Integer prime = prime_100.get(j);
				if(i != prime&& i % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				prime_10000.add(i);
			}
		}

		ArrayList<Integer> result = new ArrayList<Integer>();
		while(s.hasNext()){
			Integer number = Integer.parseInt(s.next());
			is_prime = true;
			if(result.contains(number)){
				continue;
			}
			for(int j = 0; j < prime_10000.size(); j++){
				Integer prime = prime_10000.get(j);
				if(!number.equals(prime) && number % prime == 0){
					is_prime = false;
					break;
				}
			}
			if(is_prime){
				result.add(number);
			}
		}
		System.out.println(result.size());
		s.close();
	}
}