【codeforces - 909C - Python Indentation】DP

In Python, code blocks don't have explicit begin/end or curly braces to mark beginning and end of the block. Instead, code blocks are defined by indentation.

We will consider an extremely simplified subset of Python with only two types of statements.

Simple statements are written in a single line, one per line. An example of a simple statement is assignment.

For statements are compound statements: they contain one or several other statements. For statement consists of a header written in a separate line which starts with "for" prefix, and loop body. Loop body is a block of statements indented one level further than the header of the loop. Loop body can contain both types of statements. Loop body can't be empty.

You are given a sequence of statements without indentation. Find the number of ways in which the statements can be indented to form a valid Python program.

Input

The first line contains a single integer N (1 ≤ N ≤ 5000) — the number of commands in the program. N lines of the program follow, each line describing a single command. Each command is either "f" (denoting "for statement") or "s" ("simple statement"). It is guaranteed that the last line is a simple statement.

Output

Output one line containing an integer - the number of ways the given sequence of statements can be indented modulo 109 + 7.

Examples

input

4
s
f
f
s

output

1

input

4
f
s
f
s

output

2

Note

In the first test case, there is only one way to indent the program: the second for statement must be part of the body of the first one.

simple statement
for statement
    for statement
        simple statement

In the second test case, there are two ways to indent the program: the second for statement can either be part of the first one's body or a separate statement following the first one.

for statement
    simple statement
    for statement
        simple statement

or

for statement
    simple statement
for statement
    simple statement

题意：

python 里面，给出 n 个 for 循环或陈述语句，’f’ 里面必须要有语句。按 python 缩进的方式组合成合法的程序，最后一行一定为陈述。问有多少种可能方案。

思路：

dp[i][j]代表第i行缩进j的方案数。答案即为∑dp[n][k] (0<=k<=n-1)

当第 i 个是 f 时：第 i+1 个字符一定缩进，即dp[i+1][j+1]=dp[i][j]

当第 i 个是 s 时：第 i+1 个字符的缩进量 <= 第 i 个字符的缩进量，dp[i+1][j]=∑dp[i][k] (j<=k<=n-1)

（可能不是很好理解，我看了好长时间的解题报告才想通orz）

代码：

#include<bits/stdc++.h>
using namespace std;
int dp[5005][5005];
typedef long long LL;
const LL mod = 1e9+7;
int main()
{
    int n, i, j;
    LL sum;
    char c;
    cin>>n;
    getchar();
    dp[1][0]=1;
    for(i=1; i<=n; i++)
    {
        cin>>c;
        if(c=='f')
        {
            for(j=0; j<n; j++)
            {
                dp[i+1][j+1]=dp[i][j];
            }
        }
        else
        {
            sum=0;
            for(j=n-1; j>=0; j--)
            {
                sum=(sum+dp[i][j])%mod;
                dp[i+1][j]=sum;
            }
        }
    }
    sum=0;
    for(j=0; j<n; j++)
        sum=(sum+dp[n][j])%mod;
    cout<<sum<<endl;
    return 0;
}