you give integer nYou perform follow operation number arbitrary possibly zero number time Replace n fracn2 n divisible 2 Replace n frac2n3 n divisible 3 Replace n frac4n5 n divisible 5 for example replace 30 15 operation 20 second operation 24 operationYour task find minimum number move require obtain 1 n impossible ityou answer q independent query