import math 

def PrimeMover(num):
  # maybe come up with a list of prime numbers from 0 to num+1 
  # return newArr[num]
  # how do we come up with that list 
  # the len of this array should be num+1 
  newArr = []
  count = 0
  numbers = range(2,10**4)
  for i in numbers:
    if is_prime(i) == True:
      #  print(i)
       count +=1
    # print('count',count)  
    if count == num:
      # print(i)
      return i
      
def is_prime(number):
  if number <=1:
      return False
  if number <=3:
      return True 
  if 
  
  number % 2 == 0 or number % 3 == 0              
 
print(PrimeMover(9))   
606aafbc999f3191150cfd268f2f504ecbc18f6b
import math 

def PrimeMover(num):
  # maybe come up with a list of prime numbers from 0 to num+1 
  # return newArr[num]
  # how do we come up with that list 
  # the len of this array should be num+1 
  newArr = []
  count = 0
  numbers = range(2,10**4)
  for i in numbers:
    if is_prime(i) == True:
      #  print(i)
       count +=1
    # print('count',count)  
    if count == num:
      # print(i)
      return i
      
def is_prime(number):
  if number <=1:
      return False
  if number <=3:
      return True 
  if 
  
  number % 2 == 0 or number % 3 == 0              
 
print(PrimeMover(9))   