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 ,stdout
from os import path
if(path.exists('input.txt')):
    stdin = open("input.txt","r")

amr = stdin.readline()
ind= []
sum =0
i =0 
while i < len(amr):
	if amr[i] == 'b' and len(amr)-i >= 3 and amr[i:i+4] =="bear":
		ind.append(i+3)
	i+=1
if len(ind) == 1:
	sum+=(len(amr)-ind[i])-1
else:
	for i in range(len(ind)):
		if i ==0 :
			sum+=(len(amr)-ind[i])
		else:
			for j in range(ind[i-1]-2,ind[i]-2):
				for k in range(ind[i],len(amr)):
					sum+=1
	
stdout.write(str(sum)+'\n')