Write a program that searches among the integers belonging to the numerical interval [108933; 132757] numbers which have exactly 2 different natural divisors, not counting 1 and the number itself. For each found number print these 2 divisors from a new line in ascending order of the product of these 2 divisors. Divisors must be in ascending order.