# Problem Set 1
# Name: Adnan Chowdhury
# Collaborators: None
# Time: 2:00

	
def is_prime(integ):		#Checks if an integer is a prime number
	x = 2
	checker = 0
	while x < integ:
		remainder = integ%x
		if remainder == 0:
			#number is not a prime
			checker += 1
			return False
			
		else:
			x += 1
	if checker == 0:
		return integ

prime = [2,]			#A list of which further prime numbers will be appended to


odd_value = 3			
while len(prime) != 1000:
	if is_prime(odd_value) == False: 	
		odd_value = odd_value + 2			#Will generate odd numbers
	else:
		prime.append(odd_value)				#Will append prime integer to list.
		odd_value += 2

print prime[999]							#Prints the 1000th prime number