human
Non | Function to find count of prime.
Find maximum value in the array.
Find and store all prime numbers up to max_val using Sieve Create a boolean array " prime [ 0 . . n ] " . A value in prime [ i ] will finally be false if i is Not a prime , else true ..
Remaining part of SIEVE.
If prime [ p ] is not changed , then it is a prime.
Update all multiples of p.
Function to print Non - repeating primes.
Precompute primes using Sieve.
Create HashMap to store frequency of prime numbers.
Traverse through array elements and Count frequencies of all primes.
Traverse through map and print non repeating primes.
Driver code"
Solution in Python:

=====
Can you provide a code to non and the other steps required?
assistant
#Here is code to non and the other steps required.
 def findPrimes ( arr , n ) :
	max_val = max ( arr )
	prime = [ True for i in range ( max_val + 1 ) ]
	prime [ 0 ] = False
	prime [ 1 ] = False
	p = 2
	while ( p * p <= max_val ) :
		if ( prime [ p ] == True ) :
			for i in range ( p * 2 , max_val + 1 , p ) :
				prime [ i ] = False
		p += 1
	return prime ;
def nonRepeatingPrimes ( arr , n ) :
	prime = findPrimes ( arr , n ) ;
	mp = dict ( )
	for i in range ( n ) :
		if ( prime [ arr [ i ] ] ) :
			if ( arr [ i ] in mp ) :
				mp [ arr [ i ] ] += 1
			else :
				mp [ arr [ i ] ] = 1
	for entry in mp . keys ( ) :
		if ( mp [ entry ] == 1 ) :
			print ( entry ) ;
if __name__ == ' _ _ main _ _ ' :
	arr = [ 2 , 3 , 4 , 6 , 7 , 9 , 7 , 23 , 21 , 3 ]
	n = len ( arr )
	nonRepeatingPrimes ( arr , n ) ;