Editorial :there are few observation my initial thoughts to compare some factors power with k! cs of unique factors but thats totally wrong later i realised k = ceil(d(n) / 2)where d(n) is number of divisor of n and hopefully we know the formula for calculating which is product of prime (p1+1)*(p2+1)... now we perform DFS(backtracking) over prime exponents.