Discrete mathematics..?

Find the number of different compound statements that contain n primitive statements S1,S2,.....Sn.


anyone can explain to me what does the question need ?? I don't have any idea of it..

thanks yea =)