#include<iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int dp[52][52][52][52];
int main() {
int mx = 0;
int T;
cin >> T;
for (int i = 0; i < T; i++) {
mx = 0;
string a;
string b;
cin >> a >> b;
for (int ta = 0; ta <= a.length(); ta++) {
for (int tb = 0; tb <= b.length(); tb++) {
int i, j;
for (i = 1, j = ta; j <= a.length(); i++, j++) {
int k, l;
for (k = 1, l = tb; l <= b.length(); k++, l++) {
if (ta + tb <= 1) {
dp[i][j][k][l] = 1;
} else {
dp[i][j][k][l] = 0;
if (ta > 1 && a[i - 1] == a[j - 1]) {
dp[i][j][k][l] |= dp[i + 1][j - 1][k][l];
}
if (ta && tb) {
if (a[i - 1] == b[l - 1]) {
dp[i][j][k][l] |= dp[i + 1][j][k][l - 1];
}
if (a[j - 1] == b[k - 1]) {
dp[i][j][k][l] |= dp[i][j - 1][k + 1][l];
}
}
if (tb > 1 && b[k - 1] == b[l - 1]) {
dp[i][j][k][l] |= dp[i][j][k + 1][l - 1];
}
}
if (dp[i][j][k][l]) {
mx = max(mx, ta + tb);
}
}
}
}
}
cout << mx << endl;
}
return 0;
}