Progress bars are often used to display the current state of a running process. One of the types of such strings is block line. A block line consists of $$$n$$$ identical blocks. To display progress, the percentage of which is $$$p$$$ ($$$0 \leq p \leq 1$$$), this number is multiplied by $$$n$$$, and the resulting number is rounded to the nearest integer. As a result we get the number $$$k = round (p \cdot n)$$$. Further, $$$k$$$ blocks are displayed in the progress line.

If processes are fast, it is very seldom that we see a completely filled line, so $$$n$$$ is not always possible to determine. Suppose we managed to count the number of blocks $$$k_1$$$ for the process that completed a third of the work ($$$p = 1/3$$$), and the number $$$k_2$$$ for the process that worked half ($$$p = 1/2$$$). Determine which numbers $$$n$$$ match these conditions, or report that there are no such numbers.