#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>

using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<=n;i++)
#define ALLOF(c) (c).begin(), (c).end()
#define Pa pair<ll,ll>
const ll mod=1000000007;
const ll modq=998244353;
const ll INF=1e18;
const ll inf=-1;
ll ABS(ll a){return max(a,-a);}

ll modpow(ll a,ll n) {
    ll res = 1;
    while (n>0) {
        if(n&1) res=res*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return res;
}
   
int main(void){
    vector<ll> Fib(1050);
    Fib.at(0)=0,Fib.at(1)=1;
    rep(i,1010) Fib.at(i+2)=(Fib.at(i+1)+Fib.at(i))%mod;

    ll N;
    cin>>N;
    char caa,cab,cba,cbb;
    cin>>caa>>cab>>cba>>cbb;
    if(N<4){
        cout<<1<<endl;
        return 0;
    }
    if(caa=='A' && cab=='A'){
        cout<<1<<endl;
        return 0;
    }
    if(cbb=='B' && cab=='B'){
        cout<<1<<endl;
        return 0;
    }
    if(cab=='B' && cbb=='A'){
        if(cba=='A'){
            cout<<modpow(2,N-3)<<endl;
            return 0;
        }
        cout<<Fib.at(N-1)<<endl;
        return 0;
    }
    if(cba=='B'){
        cout<<modpow(2,N-3)<<endl;
        return 0;
    }
    cout<<Fib.at(N-1)<<endl;
    return 0;
}
#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
// using namespace atcoder;

void solve()
{
	int n;
	cin>>n;
	vector<ll>a(n),b(n);
	rep(i,n)cin>>a[i];
	rep(i,n)cin>>b[i];
	ll maxv=0;
	ll pre=0;
	rep(i,n){
		ll res=0;
		
		chmax(maxv,a[i]);
		res=b[i]*maxv;
		chmax(res,pre);
		cout<<res<<"\n";
		pre=res;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}
