Why don't we make an exception for the fundamental theorem of arithmetic that 1 is prime (divisible by 1 and itself) and tell that there are 2 unique sets of primes that we can be use to represent a composite number, for example: 6 = 2 *3 == 6=2*3*1?