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

using namespace std;

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

class Hsh
{
    public:
    static const int w = 2, inf = 1000000009;
    static const int Maxn = 10003, maxp = 60554432;
    static int pwb[Maxn][w], mp[maxp][w];
    static const int b[w], p[w];
    int n, phsh[Maxn][w];
    static void GetPow()
    {
        for(int i = 0; i < w; i ++)
        {
            pwb[0][i] = 1;
            for(int j = 1; j < Maxn; j ++)
                pwb[j][i] = 1ll * pwb[j - 1][i] * b[i] % p[i];
        }
    }
    int mns(int x, int y, int p)
        {return (x >= y) ? (x - y) : (x - y + p);}
    void Bld(int s[], int N)
    {
        n = N;
        for(int i = 1; i <= n; i ++)
            for(int j = 0; j < w; j ++)
                phsh[i][j] = (1ll * phsh[i - 1][j] * b[j] % p[j] + s[i]) % p[j];
    }
    int GetH(int l, int r, int w)
        {return mns(phsh[r][w], 1ll * phsh[l - 1][w] * pwb[r - l + 1][w] % p[w], p[w]);}
    int GetCnt(int l, int r)
    {
        int ans = inf;
        for(int i = 0; i < w; i ++)
            ans = min(ans, mp[GetH(l, r, i)][i]);
        return ans;
    }
    void ModMap(int dlt)
    {
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= i; j ++)
                for(int k = 0; k < w; k ++)
                    mp[GetH(j, i, k)][k] += dlt;
    }
};

int Hsh::mp[Hsh::maxp][Hsh::w], Hsh::pwb[Hsh::Maxn][Hsh::w];
const int Hsh::b[Hsh::w] = {31, 37}, Hsh::p[Hsh::w] = {60000037, 58983751};

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()
{
    Hsh::GetPow();
    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;
}