#include <bits/stdc++.h>
using namespace std;
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i <= n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define FASTIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#ifdef _WIN32
#include <windows.h>
#define print(x) PRINT(x, #x)
template<typename T> inline const void PRINT(T VARIABLE, string NAME)
{
#ifndef ONLINE_JUDGE /// ONLINE_JUDGE IS DEFINED ON CODEFORCES
    HANDLE hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleTextAttribute(hConsole, 10);
    cerr << NAME << " = " << VARIABLE;
    SetConsoleTextAttribute(hConsole, 7);
    cerr << '\n';
#endif
}
#else
#define print(x) 0
#endif
typedef long long ll;
typedef unsigned long long ull;
const ll INFLL = 2 * (ll)1e18 + 100;
const int INFINT = 2 * (int)1e9 + 100;
const double PI = atan(1) * 4;
const double EPS = 1e-12;
const int SEED = 1e3 + 7;

const int MOD = 1e9 + 7; /// careful here (7 or 9, 66.. etc)
const int NMAX = 500 + 5;

ifstream fin("subsir.in");
ofstream fout("subsir.out");

int mmax;
int dp[NMAX][NMAX];
bool calc[NMAX][NMAX];

string s, t;

void solve(int x, int y)
{
    if(calc[x][y]) return;
    if(x == 0 || y == 0)
    {
        calc[x][y] = 1;
        return;
    }
    if(s[x - 1] == t[y - 1])
    {
        if(!calc[x - 1][y - 1]) solve(x - 1, y - 1);
        dp[x][y] = 1 + dp[x - 1][y - 1];
    }
    else
    {
        if(!calc[x - 1][y]) solve(x - 1, y);
        if(!calc[x][y - 1]) solve(x, y - 1);
        dp[x][y] = max(dp[x - 1][y], dp[x][y - 1]);
    }
    mmax = max(mmax, dp[x][y]);
    calc[x][y] = 1;
}

set<string> st;
map<pair<pair<int, int>, string>, bool> calc2;
void solve(int x, int y, string A)
{
    if(calc2[mp(mp(x, y), A)]) return;
    if(A.size() == mmax)
    {
        st.insert(A);
        calc2[mp(mp(x, y), A)] = 1;
    }
    if(x == 0 || y == 0)
    {
        calc2[mp(mp(x, y), A)] = 1;
        return;
    }

    if(s[x - 1] == t[y - 1])
    {
        A = s[x - 1] + A;
        if(!calc2[mp(mp(x - 1, y - 1), A)])
            solve(x - 1, y - 1, A);
    }
    else
    {
        if(!calc2[mp(mp(x - 1, y), A)]) solve(x - 1, y, A);
        if(!calc2[mp(mp(x, y - 1), A)]) solve(x, y - 1, A);
    }
}

int main()
{
    FASTIO;
    fin >> s >> t;
    solve(s.size(), t.size());
    solve(s.size(), t.size(), "");
    fout << st.size();

    return 0;
}