#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#define MOD 1000000007

int dp[1001];
int main() {
    int N;
    char aa,ab,ba,bb;
    cin >> N >> aa >> ab >> ba >> bb;
    if (N == 2) {
        cout << 1 << endl;
        return 0;
    }

    if (ab == 'B') {
        if (bb == 'B') {
            cout << 1 << endl;
            return 0;
        }
        else if (ba == 'A') {
            int i,p = 1;
            for (i = 0; i < N-3; i++) p *= 2,p %= MOD;
            cout << p << endl;
        }
        else {
            int i;
            dp[0] = dp[1] = 1;
            for (i = 2; i <= N; i++) {
                dp[i] = dp[i-2]+dp[i-1];
                dp[i] %= MOD;
            }
            cout << dp[N-2] << endl;
        }
    }
    else {
        if (aa == 'A') {
            cout << 1 << endl;
            return 0;
        }
        else if (ba == 'B') {
            int i,p = 1;
            for (i = 0; i < N-3; i++) p *= 2,p %= MOD;
            cout << p << endl;
        }
        else {
            int i;
            dp[0] = dp[1] = 1;
            for (i = 2; i <= N; i++) {
                dp[i] = dp[i-2]+dp[i-1];
                dp[i] %= MOD;
            }
            cout << dp[N-2] << endl;
        }
    }

    return 0;
}


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int n;
char aa,ab,ba,bb;

int main() {
	scanf("%d",&n);
	scanf(" %c",&aa);
	scanf(" %c",&ab);
	scanf(" %c",&ba);
	scanf(" %c",&bb);
	if(n==1 || n==2 || (aa=='A' && bb=='B') || (aa=='A' && ab=='A') || (ab=='B' && bb=='B')) {
		printf("1");
		return 0;
	}
	ll ans=1;
	if(ab!=ba) {
		for(int i=3;i<n;i++) {
			ans=(ans*2)%mod;
		}
	}else {
		ll prev=1;
		for(int i=3;i<n;i++) {
			ll tmp=(ans+prev)%mod;
			prev=ans;
			ans=tmp;
		}
	}
	printf("%lld",ans);
	return 0;
}