#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define vt vector
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define sz(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
#define el '\n'
const ll N = 2000 + 7;
const ll MOD = 1e9 + 7;
string t, rt, s;
int n, m;
int f[N][N], g[N][N], ans;
void solve(){
cin >> s;
n = sz(s);
s = " " + s + s;
cin >> t;
m = sz(t);
t = " " + t;
rt = t;
reverse(all(rt));
rt = " " + rt;
REP(nvl, n){
FOR(i, 1, n) FOR(j, 1, m){
f[i][j] = max({f[i - 1][j], f[i][j - 1], f[i - 1][j - 1] + (s[i + nvl] == t[j])});
g[i][j] = max({g[i - 1][j], g[i][j - 1], g[i - 1][j - 1] + (s[i + nvl] == rt[j])});
}
ans = max({ans, f[n][m], g[n][m]});
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("test.inp","r",stdin);
freopen("test.out","w",stdout);
freopen("test.err","w",stderr);
#endif
int ts=1;
// cin>>ts;
while(ts--){
solve();
}
return 0;
}
