#include<bits/stdc++.h>
#define int long long
constexpr long long mod = 1000000007;
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x) x.begin(),x.end()
#define puts(x) cout << x << "\n"
using namespace std;
int dp_a[1234], dp_b[1234];
signed main() {
	int n; char cab, cba, caa, cbb;
	cin >> n >> caa >> cab >> cba >> cbb;
	if (cab == 'B') {
		if (cbb == 'B') { puts(1); return 0; }
		if (cba == 'A') {
			int ans = 1; for1(i, n - 3) { ans *= 2; ans %= mod; }
			puts(ans);
		}
		else {
			dp_b[2] = 1;
			for (int i = 3; i <= n; i++) {
				dp_a[i] = dp_b[i - 1]; dp_b[i] = dp_a[i - 1] + dp_b[i - 1];
				dp_a[i] %= mod; dp_b[i] %= mod;
			}
			puts(dp_b[n]);
		}
	}
	else {
		if (caa == 'A') { puts(1); return 0; }
		if (cba == 'B') {
			int ans = 1; for1(i, n - 3) { ans *= 2; ans %= mod; }
			puts(ans);
		}
		else {
			dp_a[2] = 1;
			for (int i = 3; i <= n; i++) {
				dp_b[i] = dp_a[i - 1]; dp_a[i] = dp_a[i - 1] + dp_b[i - 1];
				dp_a[i] %= mod; dp_b[i] %= mod;
			}
			puts(dp_a[n]);
		}
	}
}
#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename T, T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T, T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int n;
  cin>>n;

  string s="XXXX";
  for(int i=0;i<4;i++) cin>>s[i];

  map<string, int> ans;
  ans["AAAA"]=1;
  ans["AAAB"]=1;
  ans["AABA"]=1;
  ans["AABB"]=1;
  ans["ABAA"]=128;
  ans["ABAB"]=1;
  ans["ABBA"]=34;
  ans["ABBB"]=1;
  ans["BAAA"]=34;
  ans["BAAB"]=34;
  ans["BABA"]=128;
  ans["BABB"]=128;
  ans["BBAA"]=128;
  ans["BBAB"]=1;
  ans["BBBA"]=34;
  ans["BBBB"]=1;

  if(n<=3) drop(1);

  using M = Mint<int>;
  if(ans[s]==1) drop(1);
  if(ans[s]==128) drop(M(2).pow(n-3));

  M x(1),y(1);
  for(int i=0;i<n-3;i++){
    M z=x+y;
    x=y;
    y=z;
  }
  cout<<y<<endl;
  return 0;
}
