#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

typedef long long LL;
#define int LL
#define inl inline
const int N = 3e5 + 10;
const int M = N * 2;
//const int mod=998244353;
const int mod = 1000000007;
const double eps = 1e-8;
//const int mod=1e9+7;
typedef pair<int,int> PII;
//const int INF=0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
int n, m;

void become_faster() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

vector<int>add(5),del(5);
int fun(int a[]) {
    int res=0;
    int tadd[5],tdel[5];
    for(int i=1;i<=4;i++)tadd[i]=add[i],tdel[i]=del[i];
    int sign=1;
    for(int i=1;i<=4;i++) {
        if(a[i]!=1)sign=0;
    }
    //if(sign==1)cout<<"res="<<res<<endl;
    /*if(sign) {
        cout<<"add: ";
        for(int i=1;i<=4;i++)cout<<tadd[i]<<" ";cout<<endl;
    }*/
    for(int i=1;i<=4;i++) {

        int dd[5]={0,0,0,0,0};
        if(a[i]==1) {
            res+=tadd[i];
            dd[i]=tadd[i];
            for(int j=i+1;j<=4;j++) {
                if(a[j]==1) {
                    dd[j]=min(tadd[j],dd[j-1]);
                    //tadd[j]-=min(tadd[j],tadd[j-1]);
                }
                else break;
            }
            for(int j=i+1;j<=4;j++) {
                if(a[j]==1)tadd[j]-=dd[j];
                else break;
            }
            tadd[i]=0;
        }
        else {
            res+=tdel[i];
            dd[i]=tdel[i];
            for(int j=i+1;j<=4;j++) {
                if(a[j]==-1) {
                    dd[j]=min(dd[j-1],tdel[j]);
                    //tdel[j]-=min(tdel[j-1],tdel[j]);
                }
                else break;
            }
            for(int j=i+1;j<=4;j++) {
                if(a[j]==-1) {
                    tdel[j]-=dd[j];
                }
                else break;
            }
            tdel[i]=0;
        }
        /*if(sign) {
            cout<<"add: ";
            for(int j=1;j<=4;j++)cout<<tadd[j]<<" ";cout<<endl;
        }*/
        /*if(sign) {
            cout << "add: ";
            for (int j = 1; j <= 4; j++)cout << tadd[j] << " ";
            cout << endl;
        }*/

    }

    /*if(res==2) {
        cout<<"a: ";
        for(int i=1;i<=4;i++)cout<<a[i]<<" ";cout<<endl;
    }*/
    return res;
}
void solve() {
    string s1,s2;
    cin>>s1>>s2;
    n=4;
    for(int i=0;i<4;i++) {
        int x=s1[i]-s2[i];
        if(x==0) {
            add[i+1]=del[i+1]=0;
        }
        else {
            if(x<0) {
                add[i+1]=-x;
                del[i+1]=x+10;
            }
            else {
                del[i+1]=x;
                add[i+1]=10-x;
            }
        }
    }
    //for(int i=1;i<=4;i++)cout<<add[i]<<" "<<del[i]<<endl;
    int res=100;
    int a[5];
    auto dfs=[&](auto &self,int p)->void {
        if(p>4) {
            //for(int i=1;i<=4;i++)cout<<a[i]<<" ";cout<<endl;
            res=min(res,fun(a));
            return;
        }
        a[p]=1;
        self(self,p+1);
        a[p]=-1;
        self(self,p+1);
    };
    dfs(dfs,1);
    cout<<res<<"\n";

}

signed main() {
    become_faster();
    int T = 1;
    //T=read();
    cin>>T;
    //for(int i=1;i<=100;i++)solve(i);
    while (T--) solve();
    return 0;
}