#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f3f3f3f3f

const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
int dx[22] = {1111, 1110, 1100, 1000, 100, 110, 111, 10, 11, 1, -1111, -1110, -1100, -1000, -100, -110, -111, -10, -11, -1};
map<int, int> mp, mm;
int add(int x,int y)
{
    string a = to_string(x),b = to_string(y);
    int ans = 0;
    while(a.size() < 4)
        a = '0' + a;
    while(b.size() < 4)
        b = '0' + b;
    // cout << a << " " << b << endl;
    for(int i=0;i<4;i++)
    {
        ans = (ans * 10 + (a[i] + b[i] - 2*'0') % 10);
    }
    return ans;
}
int del(int x,int y)
{

    string a = to_string(x),b = to_string(y);
    int ans = 0;
    while(a.size() < 4)
        a = '0' + a;
    while(b.size() < 4)
        b = '0' + b;
    if(a < b) swap(a,b);
    for(int i=0;i<4;i++)
        ans = (ans * 10 + (a[i] - b[i] + 10) % 10);
    return ans;
}
void bfs()
{
    queue<pair<int, int>> q;
    q.push({0, 0});
    mp[0] = 1;
    mm[0] = 0;
    while (!q.empty())
    {
        auto [x, y] = q.front();
        q.pop();
        // cout << x << " " << y << endl;
        for (int i = 0; i < 10; i++)
        {
            int tp = add(x,dx[i]);
            if (tp < 0)
                tp = add(tp,9999);
            if (mp[tp])
                continue;
            if (tp > 9999)
                continue;
            mp[tp] = 1;
            mm[tp] = y + 1;
            q.push({tp, y + 1});
        }
        for (int i = 0; i < 10; i++)
        {
            int tp = del(x,dx[i]);
            if (tp < 0)
                tp = add(tp,9999);
            if (mp[tp])
                continue;
            if (tp > 9999)
                continue;
            mp[tp] = 1;
            mm[tp] = y + 1;
            q.push({tp, y + 1});
        }
    }
}
void solve()
{
    int a, b;
    cin >> a >> b;
    // cout << add(0,1111) << endl;
    // return ;
    int ans = del(a,b);
    // cout << ans << endl;
    // int ans = abs(a - b);
    cout << mm[ans] << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    bfs();
    cin >> t;
    while (t--)
        solve();
    return 0;
}