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

struct node {
	node *next[26] = {};
	node *suffix_link = nullptr;
	int len = 0;
	int cnt = 0;
	int start = 0;
};

struct PalindromicTree {
	string s;

	node *odd, *even;

	PalindromicTree(string s) : s(s) {
		odd = new node();
		even = new node();

		odd->len = -1;
		odd->suffix_link = odd;

		even->len = 0;
		even->suffix_link = odd;

		vector<node *> nodes;
		node *curr = even;

		for (int i = 0; i < s.size(); i++) {
			int c = s[i] - 'A';

			while (true) {
				if (i - curr->len - 1 >= 0 && s[i - curr->len - 1] == s[i]) break;
				curr = curr->suffix_link;
			}

			if (curr->next[c]) {
				curr = curr->next[c];
				curr->cnt++;
				continue;
			}

			node *v = curr;
			curr->next[c] = new node();
			curr->next[c]->len = curr->len + 2;
			curr = curr->next[c];
			curr->start = i - curr->len + 1;
			nodes.push_back(curr);

			if (curr->len == 1) {
				curr->suffix_link = even;
				curr->cnt = 1;
				continue;
			}

			while (true) {
				v = v->suffix_link;
				if (i - v->len - 1 >= 0 && s[i - v->len - 1] == s[i]) break;
			}

			curr->suffix_link = v->next[c];
			curr->cnt++;
		}

		for (int i = (int)nodes.size() - 1; i >= 0; i--) {
			nodes[i]->suffix_link->cnt += nodes[i]->cnt;
		}
	}
};

long long dfs(node *x, node *y) {
	if (!x || !y) return 0;
	long long res = x->len >= 1 ? (long long)x->cnt * y->cnt : 0;
	for (int i = 0; i < 26; i++) {
		res += dfs(x->next[i], y->next[i]);
	}
	return res;
}

int main() {
	string s, t;
	cin >> s >> t;

	PalindromicTree a(s), b(t);

	cout << dfs(a.even, b.even) + dfs(a.odd, b.odd) << endl;
}