  We prove that a nonsymmetric normal entry pattern of order $n$ ($n\ge 3$) has
at most $n(n-3)/2+3$ distinct indeterminates and up to permutation similarity
this number is attained by a unique pattern which is explicitly described.
