#!/usr/bin/python
import math
max_primes = 8192
  
primes = []
 
def primo(n): 
	for i in range(2, int(math.sqrt(n))):
  		if n%i == 0: # numero nao primo
			return 1
			break

def gerarPrimos():
	for r in range(2,max_primes):
		pri=primo(r)
		if pri != 1:
			primes.append(r)


	# A imprimir valores
	print "Primos", len(primes)


gerarPrimos()