The bear has a string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub> (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*) = *s*<sub class="lower-index">*i*</sub>*s*<sub class="lower-index">*i* + 1</sub>... *s*<sub class="lower-index">*j*</sub> 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 *s*<sub class="lower-index">*k*</sub> = *b*, *s*<sub class="lower-index">*k* + 1</sub> = *e*, *s*<sub class="lower-index">*k* + 2</sub> = *a*, *s*<sub class="lower-index">*k* + 3</sub> = *r*.

Help the bear cope with the given problem.
The first line contains a non-empty string *s* (1 ≤ |*s*| ≤ 5000). It is guaranteed that the string only consists of lowercase English letters.
from sys import stdin
input = stdin.readline

def answer():

    prefix = [0] * (n + 1)

    count = 0
    for i in range(n):
        prefix[i + 1] = prefix[i]

        if((i + 3) >= n):continue

        st = a[i] + a[i + 1] + a[i + 2] + a[i + 3]

        if(st == "bear"):
            prefix[i + 1] += 1


    ans = 0
    for i in range(n):
        for j in range(i + 3 , n):

            their = prefix[j - 2] - prefix[i]

            if(their):ans += 1

    return ans
    


for T in range(1):

    a = input().strip()
    n = len(a)
    

    print(answer())

  		 					 			  	  	   	   	 	