new_contents: def check(n, primes):
      count = 0
      for num in primes:
          if n % num != 0:
              count = count + 1
      return (len(primes) == count)
  def prime(n):
      a = 2
      primes = []
      if n > 2:
          primes = [2]
          while len(primes) < n:
              a = a + 1
              if check(a, primes):
                  primes.append(a)
      return primes
  def run():
      number_wanted = int(input("Number of Primes (must be positive and not equal to 0)"))
      primes = prime(number_wanted)
      if number_wanted <= 0:
          print("Number of Primes must be positive and not equal to 0")
          yes_or_no = input("Try again? (yes or no) \n")
          if yes_or_no == "yes":
              run()
      else:
          primes = prime(number_wanted)
          for num in primes:
              print(num)
  run()
  
subject: Create the primes.py file. Find stages of the primes!