We characterize the optimal networks for a simultaneous computation of AND and NOR over the base of all 16 Boolean operators. We show that the optimal networks for AND and NOR are precisely the networks that consist of a disjoint union of an optimal network for AND with an optimal network for NOR.