#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
FILE *__ = freopen("in.txt", "r", stdin);
#endif
using namespace std;
#define LL long long

const int maxn = 4e3 + 5, mod = 998244353;

int a[10], b[10], c[10], d[10], e[10];
string s;

int f1(int x) { return abs(a[x]); }

int f2(int l, int r) { return max(f1(l), f1(r)); }

int f3(int l, int r) {
    if ((a[l] <= a[l + 1] && a[l + 1] <= a[r]) ||
        (a[l] >= a[l + 1] && a[l + 1] >= a[r]))
        return f2(l, r);
    if ((a[l] <= 0 && a[l] >= a[l + 1] && a[r] >= a[l + 1]) ||
        (a[l] >= 0 && a[l] <= a[l + 1] && a[r] >= a[l + 1]))
        return f1(l + 1);
    // if ((a[l] >= 0 && a[l] >= a[l + 1] && a[r] >= a[l + 1]) ||
    //     (a[l] <= 0 && a[l] <= a[l + 1] && a[r] >= a[l + 1]))
    return abs(a[l + 1]) + abs(a[l] - a[l + 1]) + abs(a[r] - a[l + 1]);
}

int f4() {
    if ((a[1] <= a[2] && a[2] <= a[3] && a[3] <= a[4]) ||
        (a[1] >= a[2] && a[2] >= a[3] && a[3] >= a[4]))
        return f2(1, 4);
    if (a[1] < 0)
        for (int j = 1; j <= 4; ++j) a[j] = -a[j];
    int mi = 100;
    for (int j = 1; j <= 4; ++j) mi = min(mi, a[j]);
    for (int j = 1; j <= 4; ++j) a[j] -= mi;
    if (a[1] == 0) return f3(2, 4) + mi;
    if (a[4] == 0) return f3(1, 3) + mi;
    if (a[2] == 0) return f2(3, 4) + a[1] + mi;
    return f2(1, 2) + a[4] + mi;
}

int f() {
    return (a[1] >= 0) * 8 + (a[2] >= 0) * 4 + (a[3] >= 0) * 2 +
           (a[4] >= 0) * 1;
}

void sol() {
    string s1, s2;
    cin >> s1 >> s2;
    int ans = 100;
    for (int i = 0; i < 4; ++i) d[i + 1] = s1[i] - '0', e[i + 1] = s2[i] - '0';
    for (int i = 0; i < 81; ++i) {
        for (int j = 1; j <= 4; ++j) b[j] = d[j], c[j] = e[j];
        int tmp = 1;
        for (int j = 1; j <= 4; ++j) {
            if (a[j] / tmp % 3 == 1) b[j] += 10;
            if (a[j] / tmp % 3 == 2) b[j] -= 10;
            tmp *= 3;
        }
        for (int j = 1; j <= 4; ++j) a[j] = c[j] - b[j];
        int x = f();
        if (x == 8 || x == 7) ans = min(ans, f2(2, 4) + f1(1));
        if (x == 14 || x == 1) ans = min(ans, f2(1, 3) + f1(4));
        if (x == 15 || x == 0) ans = min(ans, f4());
        if (x == 12 || x == 3) ans = min(ans, f2(1, 2) + f2(3, 4));
        if (x == 9 || x == 6) ans = min(ans, f1(1) + f1(4) + f2(2, 3));
        if (x == 10 || x == 5) ans = min(ans, f1(1) + f1(2) + f1(3) + f1(4));
        if (x == 2 || x == 13) ans = min(ans, f1(3) + f1(4) + f2(1, 2));
        if (x == 4 || x == 11) ans = min(ans, f1(1) + f1(2) + f2(3, 4));
        // cout << i << ' ' << ans << '\n';
        // if (i == 1) {
        //     cout << a[1] << ' ' << a[2] << ' ' << a[3] << ' ' << a[4] << '\n';
        // }
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) sol();
    return 0;
}