def is_prime(n):s = 0for d in range(1, n + 1):if n % d == 0:if s>2:breaks += 1if s == 2:return Trueelse:return Falsewhile True:n= int(input("Enter a number :"))if n<=1:print(n, "is neither prime nor composite.")elif is_prime(n):print(n, "is a prime number.")else:print(n, "is not a prime number.")ch= int(input("\nDo you want to retest? \n1 for yes\n2 for no :"))if ch == 2:break
