using namespace std;

#include <bitset>
#include <vector>
#define II inline
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define CC(v) memset((v),0,sizeof((v)))

#define IN "iv.in"
#define OUT "iv.out"
#define N_MAX 1<<9
#define mod 3210121

int rez,N,M;
char V1[N_MAX],V2[N_MAX];
int C[N_MAX][N_MAX],B[N_MAX][N_MAX];
vector<bool> viz1(1<<9),viz2(1<<9);
bool ok;

II void scan()
{
    freopen(IN,"r",stdin);
    freopen(OUT,"w",stdout);
    fgets(V1+1,1<<9,stdin);
    fgets(V2+1,1<<9,stdin);

    N = strlen(V1+1) - 1;
    M = strlen(V2+1) - 1;
    if(V2[M+1] != '\0' && V2[M+1] != '\n')
        ++M;

    int F[1<<9]={0};
    FOR(i,1,N)
        ++F[ (int)V1[i] ];
    FOR(i,1,M)
        ++F[ (int)V2[i] ];
    FOR(i,'a','z')
    if(F[i] & 1)
    {
        FOR(j,1,N)
            if(V1[j] == i)
                viz1[j] = true;
        FOR(j,1,M)
            if(V2[j] == i)
                viz2[j] = true;
        ok  = true;
    }
}

II void make(int i1,int C[][N_MAX],int B[][N_MAX])
{
    for(int i2=N+1;i2>i1;--i2)
    FOR(i3,0,M)
    {
        int i4 = (N+M+2) - (i3+i1+i2);
        if(!i4)
            break;
        for(;B[i2][i3] >= mod;B[i2][i3] -= mod);

        if(V1[i1 + 1] == V1[i2 - 1])
            C[i2-1][i3] += B[i2][i3];
        if(i1!=N && i4!=1 && V1[i1 + 1] == V2[i4 - 1])
            C[i2][i3] += B[i2][i3];
        if(V2[i3 + 1] == V1[i2 - 1])
            B[i2-1][i3+1] += B[i2][i3];
        if(V2[i3 + 1] == V2[i4 - 1])
            B[i2][i3+1] += B[i2][i3];

        if(!ok && i1+1==i2 && i3+1==i4)
            rez += B[i2][i3];
        if(viz1[i1+1] && viz1[i2-1] && i3+1==i4 && i1+2==i2)
            rez += B[i2][i3];
        if(viz2[i3+1] && viz2[i4-1] && i1+1==i2 && i3+2==i4)
            rez += B[i2][i3];
        if(rez > mod)
            rez -= mod;
    }
}

II void solve()
{
    B[N+1][0] = 1;

    FOR(i1,0,N)
        if(i1&1)
        {
            CC(B);
            make(i1,B,C);
        }
        else
        {
            CC(C);
            make(i1,C,B);
        }
    printf("%d\n",rez);
}

int main()
{
    scan();
    solve();
    return 0;
}