#include <bits/stdc++.h>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define pii pair<int , int>
#define pli pair<ll , int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define MASK(i) (1ll << i)
#define bit(mask , i) ((mask >> i) & 1)
#define debug cout << "NOBUG" << endl;
#define fi first
#define se second
#define i128 __int128
#define ldb long double
#define el "\n"
#define pb push_back
#define ALL(vec) vec.begin(),vec.end()
#define SORT_AND_UNIQUE(vec) sort(ALL(vec)); vec.erase(unique(ALL(vec)) , vec.end())
#define lb(vec , x) lower_bound(ALL(vec) , x)

using namespace std;
const ll oo = 0x3f3f3f3f;
const int mod = 1e9+7 , MOD = 102e6 + 100829;

void File(string NAME) {
    freopen((NAME + ".inp").c_str() , "r" , stdin);
    freopen((NAME + ".out").c_str() , "w" , stdout);
}
template <class X , class Y>
    bool maximize(X  &x , Y y) {
        if(x < y) {
            x = y;
            return true;
        }
        return false;
    }
template <class X , class Y>
    bool minimize(X  &x , Y y) {
        if(x > y) {
            x = y;
            return true;
        }
        return false;
    }
template <class X , class Y>
    void add_mod(X &x , Y y , int mod) {
        x += y;
        if(x >= mod) x -= mod;
        if(x < 0) x += mod;
    }

const int N = 250+1;
int n;
string s;
int f[N] , nxt[N];
int g[N][2];


int main()
{
    fast
    //File("TASK");
    cin >> s;
    int n = s.size();
    s = " "+s;

    f[0] = 1;

    int ans = 0;

    for(int i = 1 ; i <= n ; i++) {
        bool c = (s[i] == 'F');

        for(int sum = 0; sum < i ; sum++) nxt[sum] = f[sum];

        for(int sum = 0 ; sum < i ; sum++) {
            if(sum+(c?1:-1) < 0) continue;

            add_mod(nxt[sum+(c?1:-1)] , f[sum]-g[sum][c] , mod);
            g[sum][c] = f[sum];
        }

        for(int sum = 0; sum <= i ; sum++) {
            f[sum] = nxt[sum];
            //cout << f[sum] <<' ';
        }
        //cout << el;
    }

    cout << (f[0]-1+mod)%mod << el;
    return 0;
}