#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a, b;

int consistency(int m, int n){

	int ans = INF;
	unordered_set<string> st;
	
	for(int i=0; i<m; i++){
		for(int j=i; j<m; j++){
			string s = a.substr(i, j-i+1);
			st.insert(s);
		}
	}
	
	for(int i=0; i<n; i++){
		for(int j=i; j<n; j++){
			string s = b.substr(i, j-i+1);
			
			if(st.count(s)){
				int sz = s.size();
				int len = m+n-2*sz;
				ans = min(ans, len);
			}
		}
	}
	
	if(ans == INF) return m+n;
	return ans;

}


















void solve() {
    
    int m, n;
	
	cin >> a >> b
	;
	m = a.size();
	n = b.size();
    
    cout << consistency(m, n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}