python program to find first n prime numbers

1n = int(input("Enter a number : "))
2c = 2
3while n!=0:
4  for i in range(2,c):
5    if c%i==0:
6      break
7  else:  
8    print(c,end=" ")  
9    n-=1
10  c+=1  

1>>> def getprimes(x):	primes = []	# Loop through 9999 possible prime numbers	for a in range(1, 10000):		# Loop through every number it could divide by		for b in range(2, a):			# Does b divide evenly into a ?			if a % b == 0:				break		# Loop exited without breaking ? (It is prime)		else:			# Add the prime number to our list			primes.append(a)		# We have enough to stop ?		if len(primes) == x:			return primes		>>> getprimes(5)[1, 2, 3, 5, 7]>>> getprimes(7)[1, 2, 3, 5, 7, 11, 13]