//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const unsigned int mod = 1000000007;
//const unsigned int mod = 998244353;

struct mint {
  unsigned int x;
  mint():x(0) {}
  mint(int64_t x_) {
    int64_t v = int64_t(x_ % mod);
    if(v < 0) v += mod;
    x = (unsigned int)v;
  }
  static mint row(int v) {
    mint v_;
    v_.x = v;
    return v_;
  }
  mint operator-() const { return mint(-int64_t(x));}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    uint64_t z = x;
    z *= a.x;
    x = (unsigned int)(z % mod);
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  friend bool operator==(const mint &a, const mint &b) {return a.x == b.x;}
  friend bool operator!=(const mint &a, const mint &b) {return a.x != b.x;}
  mint &operator++() {
    x++;
    if(x == mod) x = 0;
    return *this;
  }
  mint &operator--() {
    if(x == 0) x = mod;
    x--;
    return *this;
  }
  mint operator++(int) {
    mint result = *this;
    ++*this;
    return result;
  }
  mint operator--(int) {
    mint result = *this;
    --*this;
    return result;
  }
  mint pow(int64_t t) const {
    mint x_ = *this, r = 1;
    while(t) {
      if(t&1) r *= x_;
      x_ *= x_;
      t >>= 1;
    }
    return r;
  }
  //for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) {return mint(*this) /= a;}
};

istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}

string to_string(mint a) {
  return to_string(a.x);
}

//head



int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  char aa, ab, ba, bb;
  cin >> aa >> ab >> ba >> bb;
  mint ans;
  if(ab == 'A') {
    if(aa == 'A') ans = 1;
    else {
      if(ba == 'A') {
        mint a, b;
        a = 1;
        rep(i, n-1) {
          swap(a, b);
          a += b;
        }
        ans = b;
      }
      else {
        ans = mint(2).pow(max(n-3, 0));
      }
    }
  }
  else {
    if(bb == 'B') ans = 1;
    else {
      if(ba == 'B') {
        mint a, b;
        a = 1;
        rep(i, n-1) {
          swap(a, b);
          a += b;
        }
        ans = b;
      }
      else {
        ans = mint(2).pow(max(n-3, 0));
      }
    }
  }
  cout << ans << endl;
}
#define pb push_back
#define mp make_pair
#define fi first
#define se second 
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)

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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector <int> vi;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
constexpr ll nax = 2e5+6969, INF = 2e9+6969, mod = 1e9+7;

ll n;
char c[4];

ll Pow(ll a, ll b)
{
	ll w = 1;
	while(b)
	{
		if(b&1) w = (w*a) % mod;
		a = (a*a) % mod;
		b >>= 1;
	}
	return w;
}
ll F(ll a)
{
	ll f[nax];
	f[0] = f[1] = 1;
	for(int i=2;i<=a;++i) f[i] = (f[i-1] + f[i-2]) % mod;
	return f[a];
}

int main()
{
	//  cout << F(577) << "\n";
	cin >> n;
	for(int i=0;i<4;++i) cin >> c[i];
	if(n <= 3) puts("1");
	else
	{
		if(c[1] == 'B')
		{
			if(c[3] == 'B') puts("1");
			else 
			{
				if(c[2] == 'A') cout << Pow(2LL, n-3) << "\n";
				else cout << F(n-2) << "\n";
			}
		}
		else
		{
			if(c[0] == 'A') puts("1");
			else 
			{
				if(c[2] == 'B') cout << Pow(2LL, n-3) << "\n";
				else cout << F(n-2) << "\n";
			}
		}
	}
	return 0;
}
