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