Prime Path

 

Description

The ministers of the cabinet were quite upset by the message from the Chief 

of Security stating that they would all have to change the four-digit room numbers 

on their offices.
— It is a matter of security to change such things every now and then, 

to keep the enemy in the dark.
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!
— I know, so therefore your new number 8179 is also a prime. 

You will just have to paste four new digits over the four old ones on your office door.
— No, it’s not that simple. Suppose that I change the first digit to an 8,

 then the number will read 8033 which is not a prime!
— I see, being the prime minister you cannot stand having a non-prime number 

on your door even for a few seconds.
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers 

where only one digit is changed from one prime to the next prime.
Now, the minister of finance, who had been eavesdropping, intervened.
— No unnecessary expenditure, please!

 I happen to know that the price of a digit is one pound.
— Hmm, in that case I need a computer program to minimize the cost. 

You don't know some very cheap software gurus, do you?
— In fact, I do. You see, there is this programming contest going on... 

Help the prime minister to find the cheapest prime path 

between any two given four-digit primes! 

The first digit must be nonzero, of course. 

Here is a solution in the case above.

1033
1733
3733
3739
3779
8779
8179

The cost of this solution is 6 pounds.

 Note that the digit 1 which got pasted over in step 2 can not be reused in the last step

 – a new 1 must be purchased.

Input

One line with a positive number: the number of test cases (at most 1000).

 Then for each test case, one line with two numbers separated by a blank.

 Both numbers are four-digit primes (without leading zeros).

Output

One line for each case, either with a number stating the minimal 

cost or containing the word Impossible.

Sample Input

3
1033 8179
1373 8017
1033 1033

Sample Output

6
7
0

代码

 

更多做题心得的详情请查看（记得关注哦）https://mp.weixin.qq.com/s?__biz=MzIyOTM4MDMxNw==&mid=2247483798&idx=1&sn=d4fbd34e50ce4efda39d7710d2dc5dc9&chksm=e842d824df3551320d7f1ed85286b2616aec419f7a852cc5c9c9f270beb237b5e6ca83166162&token=1630951018&lang=zh_CN#rd