#include "bits/stdc++.h"
#define int long long
using namespace std;
#define PII pair<int, int>
const int N = 2e6 + 10, M = 2e6 + 10, mod = 998244353, inf = 1e18;
double eps = 1e-9;
int n, m;
int ksm(int a, int k)
{
    int ans = 1;
    while (k)
    {
        if (k & 1)
            ans = ans * a % mod;
        a = a * a % mod;
        k >>= 1;
    }
    return ans;
}
void solve()
{
    function<int(int, int, int)> get = [&](int n, int i, int j) -> int
    {
        if ((ksm(3, n - 1) <= i && 2 * ksm(3, n - 1) > i) || (ksm(3, n - 1) <= j && 2 * ksm(3, n - 1) > j))
        {
            if (n == 1)
                return 1LL;
            return get(n - 1, i % ksm(3, n - 1), j % ksm(3, n - 1));
        }
        return 0LL;
    };
    cin >> n;
    int x = 0, y = 0;
    string s;
    cin >> s;
    for (int i = n - 1; i >= 0; i--)
    {
        x += (s[n - i - 1] - '0') * pow(3, i);
    }
    cin >> s;
    for (int i = n - 1; i >= 0; i--)
    {
        y += (s[n - i - 1] - '0') * pow(3, i);
    }
    // cout << x << " " << y << endl;
    cout << get(n, x, y) << endl;
}
signed main()
{

    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);

    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}