#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 1e5+12,INF=1e9+7;
int dp[2001][2001];
main(){
string a,b;
int i,j,n,y,m,cnt=0;
cin>>a>>b;
n = a.size();
m = b.size();
if (n > m){
swap(n,m);
swap(a,b);
}
for (i=1;i<=n;++i){
for (j=1;j<=m;++j){
dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
if (a[i-1]==b[j-1]){
dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
}
}
}
reverse(all(b));
int ans = dp[n][m];
for (y=0;y<n;++y){
a.pb(a[0]);
a.erase(a.begin());
for (i=1;i<=n;++i){
for (j=1;j<=m;++j){
dp[i][j] = max(dp[i][j-1],dp[i-1][j]);cnt++;
if (a[i-1]==b[j-1]){
dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
}
}
}
ans = max(ans,dp[n][m]);
if (cnt > 4e8+3e5){
cout <<ans;
ret 0;
}
}
reverse(all(b));
for (y=0;y<n;++y){
a.pb(a[0]);
a.erase(a.begin());
for (i=1;i<=n;++i){
for (j=1;j<=m;++j){
dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
if (a[i-1]==b[j-1]){
dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
}
}
}
ans = max(ans,dp[n][m]);
if (cnt > 4e8+3e5){
cout <<ans;
ret 0;
}
}
cout <<ans;
}
