The eccentric mathematician and dimensional builder Mr. Padalustro has spent his life studying geometric shapes in higher dimensions. His latest obsession is a structure he calls an Obo.

An Obo is an n-dimensional rectangular box. Formally, it has $$$n \geq 1$$$ sides with positive integer lengths ($$$ l_1, l_2, l_3, \ldots, l_n $$$), and its area is calculated by multiplying all the lengths:

$$$$$$AreaObo= l_1 \cdot l_2 \cdot l_3 \cdot \ldots \cdot l_n$$$$$$

Mr. Padalustro wants to build an Obo with area exactly equal to a given positive integer $$$A$$$. However, building an Obo is not easy: each side must be a positive integer greater than 1, and no side can be longer than $$$X$$$, because his tools cannot create sides longer than that.

He is also obsessed with dimensions: he wants to build an Obo with the maximum number of dimensions possible (i.e., the largest possible value of $$$n$$$ such that the product of the side lengths is exactly $$$A$$$ , and every side is less than or equal to $$$X$$$).

Your task is to help him determine the maximum number of dimensions such an Obo can have. If it is not possible to build any Obo with area exactly equal to $$$A$$$ and side lengths not greater than $$$X$$$, you must print a special message.