#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#pragma GCC optimize(3)

using namespace std;

const int maxn = 10004;
const int p1 = 30000037;
const int p2 = 30000091;
const int p3 = 28734753;
const int b1 = 91;

class Hsh
{
    public:
    static int mp1[33554432], mp2[33554432];
    static const int b1 = 31, b2 = 29;
    int n, hshv1[10005][5], phsh1[10005], hshv2[10005][5], phsh2[10005];
    void Bld(int s[], int N)
    {
        phsh1[0] = phsh2[0] = 0;
        n = N;
        for(int i = 1; i <= n; i ++)
        {
            hshv1[i][0] = s[i];
            hshv2[i][0] = s[i];
            for(int j = 1; i + j <= n && j <= 4; j ++)
            {
                hshv1[i][j] = hshv1[i][j - 1] * b1 + s[i + j];
                hshv2[i][j] = hshv2[i][j - 1] * b2 + s[i + j];
            }
            if(i + 4 <= n)
            {
                phsh1[i] = phsh1[i - 1] ^ hshv1[i][4];
                phsh2[i] = phsh2[i - 1] ^ hshv2[i][4];
                //cout<<phsh1[i]<<' '<<hshv1[i][4]<<endl;
            }
        }
    }
    int Get1(int l, int r)
    {
        if(r - l <= 4)
            return hshv1[l][r - l];
        else return phsh1[l - 1] ^ phsh1[r - 4];
    }
    int Get2(int l, int r)
    {
        if(r - l <= 4)
            return hshv2[l][r - l];
        else return phsh2[l - 1] ^ phsh2[r - 4];
    }
    int GetCnt(int l, int r)
        {return min(mp1[Get1(l, r)], mp2[Get2(l, r)]);}
    void ModMap(int w)
    {
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= i; j ++)
            {
                mp1[Get1(j, i)] += w;
                mp2[Get2(j, i)] += w;
            }
        }
    }
};

int Hsh::mp1[33554432], Hsh::mp2[33554432];
int n, m;
int s[maxn], t[maxn];
ll ans;
Hsh hs, ht;

int f[maxn], cnt[maxn];
//babaa
void wok(int dlt)
{
    for(int i = 2, l = 2 + dlt - n + 1, r = dlt; i < n; i ++, l ++)
    {
        int j = f[i - 1];
        while(j > 0 && ((i + dlt > n && (i + dlt - j <= n || j + dlt >= n)) || s[j + 1 + dlt] != s[i + dlt]))
            j = f[j];
        if(s[j + 1 + dlt] == s[i + dlt])
            j ++;
        f[i] = j;
        cnt[i] = 0;
        if(j != 0) cnt[i] ++;
        cnt[i] += cnt[j];
        if(cnt[i] && l > 1 && r - l + 1 <= m) 
            ans += cnt[i] * hs.GetCnt(l, r);
    }
}

void work(int w)
{
    ht.ModMap(1);
    for(int i = 1; i <= n; i ++)
        s[i + n] = s[i]; 
    for(int i = 1; i < n; i ++)
        wok(i);
    if(w) ht.ModMap(-1);
}

signed main()
{
    char c = getchar();
    while('a' <= c && c <= 'z')
        s[++ n] = c - 'a' + 1, c = getchar();
    while(!('a' <= c && c <= 'z'))
        c = getchar();
    while('a' <= c && c <= 'z')
        t[++ m] = c - 'a' + 1, c = getchar();
    hs.Bld(s, n);
    ht.Bld(t, m);
    work(1);
    //cout<<"-----"<<endl;
    swap(n, m);
    for(int i = 1; i <= max(n, m); i ++)
        swap(s[i], t[i]);
    swap(hs, ht);
    work(0);
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= i; j ++)
        {
            ans += hs.GetCnt(j, i);
        }
    }
    cout<<ans<<endl;
}