#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define rt return
using dbl = double;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;


template<int MOD>
class ModInt {
public:
    ModInt() :value(0) {}
    ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { }

    ModInt& operator+=(ModInt that) {
        value = value + that.value;
        if (value >= MOD)value -= MOD;
        return *this;
    }
    ModInt& operator-=(ModInt that) {
        value -= that.value;
        if (value<0)value += MOD;
        return *this;
    }
    ModInt& operator*=(ModInt that) {
        value = (int)((long long)value * that.value % MOD);
        return *this;
    }
    ModInt &operator/=(ModInt that) {
        return *this *= that.inverse();
    }
    ModInt operator+(ModInt that) const {
        return ModInt(*this) += that;
    }
    ModInt operator-(ModInt that) const {
        return ModInt(*this) -= that;
    }
    ModInt operator*(ModInt that) const {
        return ModInt(*this) *= that;
    }
    ModInt operator/(ModInt that) const {
        return ModInt(*this) /= that;
    }
    ModInt pow(long long k) const {
        if (value == 0)return 0;
        ModInt n = *this, res = 1;
        while (k) {
            if (k & 1)res *= n;
            n *= n;
            k >>= 1;
        }
        return res;
    }
    ModInt inverse() const {
        long long a = value, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }
    int toi() const { return value; }

private:
    int value;
};
typedef ModInt<1000000007> mint;
ostream& operator<<(ostream& os, const mint& x) {
    os << x.toi();
    return os;
}

mint dp[60][4][4][4][4][4][4];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    vector<string> S(2);
    cin >> N;
    cin >> S[0] >> S[1];

    dp[0][0][0][0][0][0][0] = 1;

    rep(i, N)rep(a, 4)rep(b, 4)rep(c, 4)rep(d, 4)rep(e, 4)rep(f, 4) {
        mint x = dp[i][a][b][c][d][e][f];
        if ((i==0||(a&&b))&&c&&d) {
            dp[i + 1][c][d][e][f][0][0] += x;
            continue;
        }

        if (c == 0 && d == 0 && S[0][i] == S[1][i]) {
            FOR(cd, 1, 4)if (a != cd&&b != cd) {
                dp[i][a][b][cd][cd][e][f] += x;
            }
        }
        if (c == 0 && e == 0 && i < N - 1 && S[0][i] == S[0][i + 1]) {
            FOR(ce, 1, 4)if (ce != a && ce != d && ce != f) {
                dp[i][a][b][ce][d][ce][f] += x;
            }
        }else if (!d && !f&&i < N - 1 && S[1][i] == S[1][i + 1]) {
            FOR(df, 1, 4)if (df != b&&df != c&&df != e) {
                dp[i][a][b][c][df][e][df] += x;
            }
        }
    }

    mint ans;
    FOR(i, 1, 4)FOR(j, 1, 4)ans += dp[N][i][j][0][0][0][0];
    cout << ans << endl;
}


Measured memory_bytes: 1280