case align can 註意 from which 相同 exchange mil

Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.
Each time, you can add or minus 1 to any digit. When add 1 to ‘9‘, the digit will change to be ‘1‘ and when minus 1 to ‘1‘, the digit will change to be ‘9‘. You can also exchange the digit with its neighbor. Each action will take one step.

Now your task is to use minimal steps to open the lock.

Note: The leftmost digit is not the neighbor of the rightmost digit.

Input The input file begins with an integer T, indicating the number of test cases.

Each test case begins with a four digit N, indicating the initial state of the password lock. Then followed a line with anotther four dight M, indicating the password which can open the lock. There is one blank line after each test case.

Output For each test case, print the minimal steps in one line.

Sample Input 2 1234 2144 1111 9999

Sample Output 2 4 入門級bfs，分析各種可能情況，廣度搜索密碼，以初始密碼為基，密碼的每位可以加一，減一，與鄰位互換，三種情況，共產生十一種可能密碼數， 每種密碼數又經過相同操作，同可以產生十一種可能。利用隊列先進先出的特性，進行廣度搜索。需註意標記已產生的數，避免重復操作。

Open the Lock