#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000000007
ifstream in("subsir.in");
ofstream out("subsir.out");
int dp[501][501];
int main(){
    string a,b;
    in>>a>>b;
    int i,j;
    int n=a.length();
    int m=b.length();
    for(i=1; i<=n; ++i){
        for(j=1; j<=m; ++j){
            if(a[i-1]==b[j-1])
                dp[i][j]=dp[i-1][j-1]+1;
            else
                dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
        }
    }
    j=1;
    i=1;
    while(dp[i][m]==0)
        ++i;
    while(dp[i][j]==0)
        ++j;
    out<<j-i+1<<" ";
    return 0;
}