// بسم الله الرحمن الرحيم
 
// link:  
// NOTE:  

#include <bits/stdc++.h>
using namespace std;

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { for (auto &i : v) os << i << ' '; return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &i : v) is >> i; return is; } 
#define endl        '\n'
#define int         long long
#define ull         unsigned long long
#define pii         pair<int, int>
#define vi          vector<int> 
#define all(v)      v.begin(), v.end()
#define allr(v)    v.rbegin(), v.rend()
#define Num_of_Digits(n) ((int(log10(n)) + 1))

#define ElgamalyHowaAmaly  ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << fixed << setprecision(10)
const double EPS = 1e-9;
const int Mod = 1e9+7; //  998244353;
const int N = 2e5+7;

 
void solve1()
{
    string a, b;    cin >> a >> b;
    map<string, int> m;
    for(int i = 0; i < a.size(); ++i){
        string s = "";
        for(int j = i; j < a.size(); ++j){
            s += a[j];
            m[s] = 1;
        }
    }
    
    int x = 0;
    for(int i = 0; i < b.size(); ++i){
        string s = "";
        for(int j = i; j < b.size(); ++j){
            s += b[j];
            if(m[s] == 1){
                if(s.size() > x){
                    x = s.size();
                }
            }
        }
    }

    if(x == 0) cout << a.size() + b.size() << endl;
    else {
        cout << a.size() - x + b.size() - x << endl;
    }
}

signed main(){
 
    ElgamalyHowaAmaly;
    
    int t = 1;
    cin >> t;
    for(int test = 1; test <= t; ++test)
    {
        solve1();
    }
    return 0;
}