#include<bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

struct PalindromicTree {
	struct node {
		map<char,int> next;
		int len, sufflink,num,first;
	};
	string S;
	vector<node> V;
	int n,s; // num,suff

	bool add(int pos) {
		char ch=S[pos];
		int c=s, cl=0;
		while(1) {
			cl=V[c].len;
			if(pos-1-cl>=0 && S[pos-1-cl]==ch) break;
			c=V[c].sufflink;
		}

		if(V[c].next.count(ch)) {
			s = V[c].next[ch];
			return false;
		}

		s=++n;
		V[n].len=V[c].len+2;
		V[n].first=pos;
		V[c].next[ch]=n;

		if(V[n].len==1) { // even length
			V[n].sufflink=2;
			V[n].num=1;
			return true;
		}

		while(1) {
			c=V[c].sufflink;
			cl=V[c].len;
			if(pos-1-cl>=0 && S[pos-1-cl]==ch) {
				V[n].sufflink=V[c].next[ch];
				break;
			}
		}
		V[n].num=1+V[V[n].sufflink].num;
		return true;
	}

	void init(string S) {
		this->S=S;
		V.clear();
		V.resize(S.size()+10);

		n=s=2;
		V[1].first=V[2].first=-1;
		V[1].len=-1;
		V[2].len=0;
		V[1].sufflink=V[2].sufflink=1;
	}
};

int dps[1111111],dpt[1111111];

signed main(){
    cin.tie(0);ios_base::sync_with_stdio(0);

    string S,T;
    cin>>S>>T;

    string ST=S+"@*"+T;
    PalindromicTree pt;pt.init(ST);
    for(int i=0;i<ST.size();i++){
        pt.add(i);
        if(i<S.size())dps[pt.s]++;
        else if(i>S.size())dpt[pt.s]++;
    }

    int ans=0;
    for(int i=pt.n;i>2;i--){
        ans+=dps[i]*dpt[i];
        dps[pt.V[i].sufflink]+=dps[i];
        dpt[pt.V[i].sufflink]+=dpt[i];
    }

    cout<<ans<<endl;
    return 0;
}