#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>

using namespace std;


const int mod = 1000000007;
struct Mod {
public:
	int num;
	Mod() : Mod(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) {
		static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");
	}
	Mod(int n) : Mod(static_cast<long long int>(n)) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator+(const Mod a, const long long int  b) { return b + a; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }
Mod operator*(const Mod a, const int b) { return Mod(b)*a; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const long long  int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	return Mod(a) / b;
}
Mod operator/=(Mod &a, const Mod b) {
	return a = a / b;
}

#define MAX_MOD_N 1024000

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init(const int amax = MAX_MOD_N) {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < amax - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}

const int dx[4] = { -1,0,1,0 };
const int dy[4] = { 0,1,0,-1 };
int main() {
	
	int N; cin >> N;

	vector<string>field(2);
	for (int i = 0; i < 2; ++i) {
		string st; cin >> st;
		field[i] = st;
	}
	vector<vector<int>>type(2, vector<int>(N));
	for (int i = 0; i < 2; ++i) {
		for (int j = 0; j < N; ++j) {
			int nowc = field[i][j];
			for (int way = 0; way < 4; ++way) {
				int nx = j + dx[way];
				int ny = i + dy[way];
				if (nx >= 0 && nx < N&&ny >= 0 && ny < 2) {
					if (nowc == field[ny][nx]) {
						type[i][j] = way;
					}
				}
			}
		}
	}
	vector<vector<vector<Mod>>>memo(N+1, vector<vector<Mod>>(4,vector<Mod>(4)));
	memo[0][3][3] = 1;
	for (int i = 0; i < N; ++i) {
		for (int ulc = 0; ulc <4; ++ulc) {
			for (int dlc = 0; dlc < 4; ++dlc) {
				for (int urc = 0; urc < 3; ++urc) {
					for (int drc = 0; drc < 3; ++drc) {
						bool ok = true;
						if (type[0][i] == 0) {
							if (urc != ulc)ok = false;
							if (urc == drc)ok = false;
						}
						else if (type[0][i] == 1) {
							if (urc == ulc)ok = false;
							if (urc != drc)ok = false;
						}
						else if (type[0][i] == 2) {
							if (urc == ulc)ok = false;
							if (urc == drc)ok = false;
						}
						else {
							assert(false);
						}
						
						if (type[1][i] == 0) {
							if (dlc != drc)ok = false;
						}
						else if (type[1][i] == 1) {
							assert(false);
						}
						else if (type[1][i] == 2) {
							if (dlc == drc)ok = false;
						}
						else {
							if (dlc == drc)ok = false;
						}
						if (ok)memo[i + 1][urc][drc] += memo[i][ulc][dlc];
					}
				}
			}
		}
	}
	Mod ans = 0;
	for (int i = 0; i < 3; ++i) {
		for (int j = 0; j < 3; ++j) {
			ans += memo[N][i][j];
		}
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 8320