Problem Background

Ada is trapped in a room.

Problem Description

On the iron door of the room, there is a button and a display showing "1".
Next to it, there is a small line of text: "This is a high-precision M-ary calculator. Each time the button is pressed, the number on the screen is multiplied by K. When the unit digit returns to 1, the door will open."
Since Ada is eager to get out, you need to calculate the minimum number of button presses within 1 second.

Input Format

A single line containing two integers, M and K.

Output Format

A single line with a number representing the minimum number of button presses.
If Ada can never press the button enough times to open the door, output "Let's go Blue Jays!" (without quotes).

Sample Input and Output

Sample Input #1

11 2

Sample Output #1

10

Sample Input #2

6 26

Sample Output #2

Let's go Blue Jays!

Notes

For 30% of the data, $2 \leq M, K \leq 10^4$.
For 100% of the data, $2 \leq M, K \leq 2 \times 10^9$.
Update: We do not consider unit digits like 11, 21, etc., as solutions to the problem (e.g., 11 in hexadecimal is denoted as B).

见题面 Input 部分

见题面 Output 部分