#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
short int n, m, k;
string a, b;
string B;
int ans;
int dp[2005][2005];
int iter = 0;
inline void do_it_now(){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
iter++;
dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
if(a[i-1] == b[j-1]){
chmax(dp[i][j], dp[i-1][j-1]+1);
}
}
}
chmax(ans, dp[n][m]);
}
void solve(int test_case){
short int i, j;
cin >> a >> B;
if(a.length() < B.length())swap(a,B);
n = a.length(), m = B.length();
for(i=0;i<m;i++){
short int now = i;
b.erase(all(b));
for(j=0;j<m;j++){
if(now == m)now=0;
b.pb(B[now]);
now++;
}
do_it_now();
reverse(all(b));
do_it_now();
if(iter > 4e8){
break;
}
}
cout << ans << '\n';
return;
}
signed main(){
FASTIO;
solve(1);
return 0;
}
