#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve() {
    i64 l, r;
    cin >> l >> r;
    vector<int> a(60), b(60);
    int suml = 0, sumr = 0, ans = 0, h = -1;
    for (int i = 0; i < 60; i++) {
        a[i] = l % 3;
        l /= 3;
        b[i] = r % 3;
        r /= 3;
        sumr += b[i];
        if (b[i]) h = max(h, i);
    }
    ans = sumr + h + 1;
    bool ok = false;
    for (int i = 3; i >= 0; i--) {
        if (b[i] > a[i]) {
            ok = true;
            if (i == h) {
                if (b[i] == 1) {
                    ans = max(ans, suml + 2 * i + h);
                } else {
                    ans = max(ans, 1 + suml + 2 * i + h + 1);
                }
            } else {
                ans = max(ans, suml + b[i] - 1 + 2 * i + h + 1);
            }
        } else if (ok) {
            ans = max(ans, suml + b[i] - 1 + 2 * i + h + 1);
        }
        suml += b[i];
        sumr -= b[i];
        // cout << ans << ' ';
    }
    cout << ans << '\n';
}
signed main(){
    // ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int T = 1; 
    cin >> T;
    while (T--) solve();
    return 0;
}
/*
5
1 1 1
2 3 3
9 9 9
3 26 47
1064 822 1048576
*/