Determine all possible triplet(s) (P, Q, N) of positive integers, with P < Q and N ≥ 3, such that the decimal representations of P^N and Q^N will together contain each of the digits 0 to 9 exactly once. Neither P^N nor Q^N can contain any leading zero.