#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

modint dfs(int l, int r, int k) {
	if (l == 0 && r == 0 && k == 0)return 1;
	modint res = 0;
	modint cl = l, cr = r, ck = k;
	if (l > 0)res += cl * (cl+ck)*dfs(l - 1, r, k);
	if (r > 0)res += (cr+ck) * cr*dfs(l, r - 1, k);
	if (l > 0&&r>0)res += cl * cr*dfs(l - 1, r-1, k + 1);
	if (k > 0)res += (cr + ck)*ck*dfs(l, r, k - 1);
	return res;
}
void solve() {
	string s, t; cin >> s >> t;
	int x = 0, y = 0;
	rep(i, s.size()) {
		if (s[i] == '1') {
			if (t[i] == '1')x++;
			else y++;
		}
	}
	vector<vector<bool>> used(x + 1);
	vector<vector<modint>> memo(x + 1);
	rep(i, x + 1) {
		used[i].resize(y + 1, false);
		memo[i].resize(y + 1, 0);
	}
	used[0][0] = true; memo[0][0] = 1;
	function<modint(int, int)> dp = [&](int l, int r)->modint {
		if (used[l][r])return memo[l][r];
		used[l][r] = true;
		modint res = 0;
		modint cl = l;
		modint cr = r;
		if (l>0&&r > 0)res += cl*cr*dp(l-1, r);
		if (r > 0)res += cr * cr*dp(l, r - 1);
		return memo[l][r] = res;
	};
	modint ans = 0;
	rep(a, x + 1) {
		modint c1 = comb(x, a)*fact[a] * fact[a];
		modint c2 = dp(x - a, y);
		modint sum = c1 * c2*comb(x + y, a);
		//cout << sum << endl;
		ans += sum;
	}
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}


Measured memory_bytes: 117120