#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("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&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 = 3e5+12,INF=100500;
int q[N],n,m;
int dp[2001][2001];
int fun(deque<char> &a,deque<char> &b){
int i,j;
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);
}
}
}
ret dp[n][m];
}
void rev(deque <char> &a){
a.pb(a[0]);
a.pop_front();
}
main(){
deque<char> a,b;
string ss,s;
cin>>ss>>s;
n = ss.size();m = s.size();
int i,j;
for (i=0;i<n;++i){
a.pb(ss[i]);
}
for (i=0;i<m;++i){
b.pb(s[i]);
}
int ans = fun(a,b);
for (i=1;i<n;++i){
rev(a);
for (j=1;j<m;++j){
rev(b);
ans = max(ans,fun(a,b));
}
}
cout <<ans;
}
