第五场 E Minimum number of steps（思维）

D. Minimum number of steps

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each step we choose one of substrings "ab" in the string and replace it with the string "bba". If we have no "ab" as a substring, our job is done. Print the minimum number of steps we should perform to make our job done modulo 109 + 7.

The string "ab" appears as a substring if there is a letter 'b' right after the letter 'a' somewhere in the string.

Input

The first line contains the initial string consisting of letters 'a' and 'b' only with length from 1 to 106.

Output

Print the minimum number of steps modulo 109 + 7.

Examples

input

Copy

ab

output

1

input

Copy

aab

output

3

Note

The first example: "ab"  →  "bba".

The second example: "aab"  →  "abba"  →  "bbaba"  →  "bbbbaa".

题意：给定一个只有a和b的字符串，当遇到ab子串时，就替换成bba，问一个由a和b组成的字符串总共要进行多少次这样的操作。

思路：通过举例子可以发现，每个操作完的字符串a总是全在最右边，数目不变，而b当遇到一个向后“移动”的a时，数目就会增加一倍。    总结来说就是a在向最右端移动时总共经过几个b就操作几次，知道了b的变化规律，我们只需在从后向前处理字符串时，每遇到一个a就统计其后有几个b即可。直到统计完所有的a。最后就是对结果的处理， 109 + 7=1000000007.

string头文件：<string>.

#include<cstdio>
#include<string>
#include<iostream>
#define INF 1000000007
using namespace std;
int main()
{
    string s;
    cin>>s;
    int cnt=0,sum=0;
    int len=s.length();
    for(int i=len-1;i>=0;i--)
    {
        if(s[i]=='b')
            cnt++;
        else if(s[i]=='a')
        {
            sum=(sum+cnt)%INF;
            cnt=(2*cnt)%INF;
        }
    }
    printf("%d\n",sum);
    return 0;
}