The maximum number of compound propositions, out of p r s, p r ∼ s, p ∼ q s, ∼ p ∼ r s, ∼ p ∼ r ∼ s, ∼ p q ∼ s, q r ∼ s, q ∼ r ∼ s, ∼ p ∼ q ∼ s that…

The maximum number of compound propositions, out of $\displaystyle \mathrm{p} \vee \mathrm{r} \vee \mathrm{s}, \mathrm{p} \vee \mathrm{r} \vee \sim \mathrm{s}, \mathrm{p} \vee \sim \mathrm{q} \vee \mathrm{s}, \sim \mathrm{p} \vee \sim \mathrm{r} \vee \mathrm{s}$, $\displaystyle \sim \mathrm{p} \vee \sim \mathrm{r} \vee \sim \mathrm{s}, \sim \mathrm{p} \vee \mathrm{q} \vee \sim \mathrm{s}, \mathrm{q} \vee \mathrm{r} \vee \sim \mathrm{s}, \mathrm{q} \vee \sim \mathrm{r} \vee \sim \mathrm{s}, \sim \mathrm{p} \vee \sim \mathrm{q} \vee \sim \mathrm{s}$ that can be made simultaneously true by an assignment of the truth values to p, q, r and s, is equal to \_\_\_\_.