Problem: The bear has a string s = s1s2... s|s| (record |s| is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices i, j (1 ≤ i ≤ j ≤ |s|), that string x(i, j) = sisi + 1... sj contains at least one string "bear" as a substring.

String x(i, j) contains string "bear", if there is such index k (i ≤ k ≤ j - 3), that sk = b, sk + 1 = e, sk + 2 = a, sk + 3 = r.

Help the bear cope with the given problem.

Input

The first line contains a non-empty string s (1 ≤ |s| ≤ 5000). It is guaranteed that the string only consists of lowercase English letters.

Output

Print a single number — the answer to the problem.

Examples

Input

bearbtear


Output

6


Input

bearaabearc


Output

20

Note

In the first sample, the following pairs (i, j) match: (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9).

In the second sample, the following pairs (i, j) match: (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9), (1, 10), (1, 11), (2, 10), (2, 11), (3, 10), (3, 11), (4, 10), (4, 11), (5, 10), (5, 11), (6, 10), (6, 11), (7, 10), (7, 11).

Solution (in JAVA):

Solution:
import java.util.*;
public class BearAndStrings {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		String s=sc.next();
		//System.out.println(s.length());
		int ans=0;
		int pos=0;
		int f=0,l=0,fi=0;
		for(int i=0;i<s.length()-3;i++) {
			if(s.charAt(i)=='b') {
				if(s.charAt(i+1)=='e') {
					if(s.charAt(i+2)=='a') {
						if(s.charAt(i+3)=='r') {
							if(fi==0) {
								ans+=((i+1)-f)*(s.length()-(i+3));
								f=i;
//								System.out.println(((i+1)-f)*(s.length()-(i+3)));
//								System.out.println(i+" "+f);
								fi++;
							}
//							else if(i==s.length()-4) {
//								ans+=4;
//								break;
//							}
							else {
//								System.out.println((i-f)*(s.length()-(i+3))+"gh");
//								System.out.println(i+" "+f);
								ans+=(i-f)*(s.length()-(i+3));
								f=i;
							}
						}
					}
				}
			}
		}
		System.out.println(ans);

	}

}