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.
def get_ints():
    return map(int, input().strip().split())

def get_list():
    return list(map(int, input().strip().split()))

def get_string():
    return input().strip()

# For fast IO use sys.stdout.write(str(x) + "\n") instead of print
import sys
import math
input = sys.stdin.readline

for t in range(1):
    s = input().strip()
    n = len(s)
    target = "bear"
    ans = 0
    last_match = -1
    
    for i in range(n-3):
        for j in range(0,4):
            if s[i+j] != target[j]:
                break
        else:
            possible_starts = i+1
            if last_match != -1:
                possible_starts = i - (last_match+1) + 1
            possible_ends = n-(i+3)
            ans += possible_starts * possible_ends
            last_match = i
            # print(i, possible_starts, possible_ends, ans, s)
    print(ans)
        
    