Assuming that only X and Y logic inputs are available and their complements X and Y are not available, then what is the minimum number of two-input nand gates require to implement X ⊕ Y?