codeforce 805D（取模运算）

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 10⁹ + 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 10⁶.

Output

Print the minimum number of steps modulo 10⁹ + 7.

Example

Input

ab

Output

1

Input

aab

Output

3

Note

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

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

/*题意：碰到ab就换为bba问最少换多少次*/

/*思路： 将a向右移动到最右边，a个数不变，没移动n次产生n个b*/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 1e9 + 7;
int num[1000000+10];

int main()
{
    string s;
    while(cin >> s){
        long long sum = 0;
        long long ans = 0;
        for(long long i = s.length()-1; i >= 0; i--){
            if(s[i] == 'b') ans++;  //ans为b的个数
            if(s[i] == 'a' && ans != 0){
                sum = (sum + ans) % maxn ;
                ans = (ans * 2) % maxn;     //这里记着先取模不然这里会先爆然后下次运算会错
            }
        }
        printf("%lld\n", sum);
    }
    return 0;
}