#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll f(ll x){
    if(x==0)return 1;
    if(x%3==0)return f(x/3)+1;
    return f(x-1)+1;
}
void solve(){
    ll l,r,ans=0;
    cin>>l>>r;
    vector<int> bit;
    ll cur=r;
    while(cur>0){
        bit.push_back(int(cur%3));
        cur/=3;
    }
    int n=(int)bit.size();
    for(int i=0;i<n;i++){
        ll now=0;
        for(int j=0;j<i;j++){
            now=now*3+bit[j];
        }
        now=now*3+bit[i]-1;
        for(int j=i+1;j<n;j++){
            now=now*3+2;
        }
        if(now>=l)ans=max(ans,f(now));
    }
    cout<<max({ans,f(l),f(r)})<<'\n';
    return void();
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}