#include <bits/stdc++.h>
using namespace std;
int n;
vector <string> s;
vector <unsigned long long> t,f;
int main(){
    cin >> n;
    s = vector<string>(n);
    for(int i = 0; i < n; i++){
        cin >> s[i];
    }
    t = vector<unsigned long long>(n+1,0);
    f = vector<unsigned long long>(n+1,0);
    t[0]=1;
    f[0]=1;
    for(long long i = 1; i <= n; i++){
        if(s[i-1].compare("AND")==0){
            t[i]=t[i-1];
            f[i]=t[i-1]+2*f[i-1];
        }else{
            t[i]=f[i-1]+2*t[i-1];
            f[i]=f[i-1];
        }
    }
    #if 0
    for(long i = 0; i <= n; i++){
        cout << t[i] << " ";
    }
    cout << endl;
    for(long i = 0; i <= n; i++){
        cout << f[i] << " ";
    }
    cout << endl;
    #endif
    cout << t.back() << endl;
    return 0;
}
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;

#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define ini(a, i) memset(a, i, sizeof(a))
#define inin(a, n, i) memset(a, i, sizeof(a[0])*(n))
#define contains(c, i) ((c).find(i) != (c).end())
#define present(i, c) (find(all(c), i) != (c).end())

#define trav(x, c) for(auto& x : c)
#define rep(i, n) for(int i = 0; i < n; i++)
#define repa(i, b, e) for(int i = (b)-((b)>(e)); i != (e)-((b)>(e)); i += 1-2*((b)>(e)))
	
template<class T> bool chkmax(T &x, T y) { return x < y ? x = y, true : false; }
template<class T> bool chkmin(T &x, T y) { return x > y ? x = y, true : false; }
template<class A, class B> A cvt(B x) { stringstream s; s << x; A r; s >> r; return r; }

void read() {}
void print() {}
template<class T, class... Args> void read(T& a, Args&... args) { cin >> a; read(args...); }
template<class T, class... Args> void print(T a, Args... args) { cout << a << ' '; print(args...); }
template<class... Args> void println(Args... args) { print(args...); cout << '\n'; }

#define debug(args...) { string s_(#args); replace(all(s_), ',', ' '); stringstream ss_(s_); istream_iterator<string> it_(ss_); cerr_(it_, args); }
void cerr_(istream_iterator<string> it) { (void) it; }
template<class T, class... Args> void cerr_(istream_iterator<string> it, T a, Args... args) { cerr << *it << " = " << a << endl; cerr_(++it, args...); }

template<class T, class S>  ostream& operator<<(ostream& os, const pair<T, S>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<class T> ostream& operator<<(ostream &os, const set<T> &s) { os << '{'; string sep; for (const auto &x : s) os << sep << x, sep = ", "; return os << '}'; }
template<class T, class S> ostream& operator<<(ostream &os, const map<T, S> &m) { os << '{'; string sep; for (const auto &x : m) os << sep << x, sep = ", "; return os << '}'; }
template<class T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }

const int INF = 0x3F3F3F3F;
const int MAXN = (int) 1e6;
const int MOD = (int) 1e9+7;

//=========================

void run_test() {
    int n; read(n);
    vi v(n+1);
    rep(i, n) {
        string s; read(s);
        if(s == "AND") v[i+1] = 0;
        else v[i+1] = 1;
    }

    vector<vll> dp(2, vll(n+1));
    dp[1][0] = 1;
    dp[0][0] = 1;

    for(int i = 1; i <= n; i++) {
        if(!v[i]) {
            dp[1][i] += dp[1][i-1];
            dp[0][i] += dp[0][i-1] + dp[1][i-1];    // current is false
            dp[0][i] += dp[0][i-1];                 // current is true
        } else {
            dp[1][i] += dp[1][i-1] + dp[0][i-1];    // current is true
            dp[1][i] += dp[1][i-1];                 // current is false
            dp[0][i] += dp[0][i-1];
        }
    }

    ll ans = dp[1][n];
    println(ans);
}

//=========================

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	//int t_ = 1, t__; cin >> t__; while(t_ <= t__) { cout << "Case #" << t_++ << ": "; run_test(); }
	// int t_; cin >> t_; while(t_--) run_test();
	run_test();
	return 0;	
}
