#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define mod (int)(2000000011)
#define pb push_back
#define mll map<ll,ll>
#define vl vector<ll>
const int inf = 0x7f7f7f7f;
long long comb(int n, int k) { if (k > n) return 0;
if (k == 0 || k == n) return 1;  
long long ret = 1; if (k > n - k) k = n - k;
for (int i = 0; i < k; i++) { 
    ret *= (n - i);
    ret /= (i + 1); 
 }
return ret;
}
ll get_hash(string &s) {
    ll h = 0;
    for (char c : s) h = (h * 31 + (c - 'a' + 1));
    return h % mod;
}

ll findgcd(vector<long long> &arr) {
   ll result = arr[0];
   ll n = arr.size();
   for (ll i = 1; i < n; i++) {
       result = __gcd(result, arr[i]);
   }
   return result;
}

ll findlcm(vector<long long> &arr) {
    ll result = arr[0];
    int n = arr.size();
    for (int i = 1; i < n; i++) {
        result = ((arr[i] * result) / __gcd(arr[i], result));
    }
    return result;
}

long long power(long long A, long long B, long long MOD) {
    long long res = 1;
    while (B > 0) {
        if (B % 2 == 1) { 
            res = (res * A) % MOD;
        }
        A = (A * A) % MOD;
        B /= 2;
    }
    return res;
}
void dfs(int curr, vector<vector<int>>& edges, vector<int>& vis, int& size) {
    vis[curr] = 1; 
    size++; 
    for (auto e : edges[curr]) {
        if (!vis[e]) {
            dfs(e, edges, vis, size);
        }
    }
}
ll fact(int n) {
    if (n <= 1) return 1;
    else return n * fact(n - 1);
}

vector<int> sieveOfEratosthenes(int limit) {
    vector<bool> isPrime(limit + 1, true);
    vector<int> primes;
    
    isPrime[0] = isPrime[1] = false;

    for (int i = 2; i * i <= limit; ++i) {
        if (isPrime[i]) {
            for (int j = i * i; j <= limit; j += i) {
                isPrime[j] = false;
            }
        }
    }

    for (int i = 2; i <= limit; ++i) {
        if (isPrime[i]) {
            primes.push_back(i);
        }
    }

    return primes;
}

ll gcd(ll a, ll b) {
    while (b != 0) {
        ll temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}
int check(vector<int> a,vector<int> b){

}
bool ispalindrome(vector<int> &vec){
    vi b;
    b = vec;
    reverse(b.begin(),b.end());
    return (b==vec);
}
void aditya(){
 string s,t;cin>>s>>t;int rot[5],back[5];
 int n=4;
 int m = 81,ans = 1e9;
 for(int i=0;i<4;i++){
   rot[i]=s[i]-t[i];
 }
 for(int i=0;i<m;i++){
   int state =i;
   for(int j=0;j<4;j++){
    if(state % 3== 1){
        if(rot[j]>0){
            back[j]=rot[j]-10;
        }
        else {
            back[j]=rot[j]+10;
        }
    }
    else if(state %3 ==2 and (!rot[j])){
        back[j]=-10;
    }
    else { back[j]=rot[j];}
    state/=3;
   }
   int positive =0,negative =0;
   for(int j=0;j<4;j++){
    int dif = (j?back[j]-back[j-1]:back[j]);
    if(dif>0) positive += dif;
    else negative += dif;
   }
    ans = min(ans,max(positive,abs(negative)));
 }
 cout<<ans<<endl;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //nt tc=1;
    int tc;cin>>tc;
    for (int i = 0; i < tc; i++) {
        aditya();
    }
    return 0;
}