Sum of Products

You need to design a combinational logic circuit that outputs '1' if a 4-bit binary input (N3, N2, N1, N0) is a prime number (considering primes > 1). What is the minimum number of product terms required for a sum-of-products (SOP) implementation after Karnaugh map minimization?