Define a grammar by setting = {} and let F consist of the following three formulas. N V N. N n, for some n is in {Moe, Larry, Curly}.

Need help with this question:

Define a grammar by setting Σ = {σ} and let F consist of the following three formulas.

1. σ → N V N. 

2. N → n, for some n is in {Moe, Larry, Curly}. 

3. V → v, for some v is in {hit, poked, spanked, kicked, punched}.

How many different grammatical sentences are there in the terminal language defined by the grammar?

I think the answer would be 30 but that doesn't seem correct