Coin System

In the country where Youngsun lives, there are two kinds of coins, A and B. Every product in this country has a price of the form $A \times p + B \times q$ ($p$ and $q$ are non-negative integers), so these two coins are enough.

One day Youngsun wondered whether a different coin system could also make the price of every product in this country.

Given A, B, and X, write a program that finds the values of two coins that can make every price of the form $A \times p + B \times q$. One coin has value X and the other has value Y ($Y \neq X$). Since X is given in the input, the task is to find Y. In the new system each coin can also be used any non-negative integer number of times, and Y is a positive integer.

The first line contains A, B, and X. ($1 \le A, B, X \le 200$)

Print the number of possible values of Y on the first line. If there are infinitely many possible values of Y, print -1.