The Sheffer stroke (NAND, denoted by $|$) is a functionally complete operator. What is the minimum number of occurrences of the Sheffer stroke operator $|$ required to write an expression logically equivalent to the disjunction $P \lor Q$ using only $P$, $Q$, and $|$?