Alice and Bob are playing "factoring game." On the paper, 270000(=243354) is written and each person picks one number from the paper(call it N) and erase N and writes integer X,Y such that N=XY and gcd(X,Y)=1. Alice goes first and the person who can no longer make this factoring loses. If two people use optimal strategy, prove that Alice always win. primesCombinatorial gamescombinatorics