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.
const
  maxn=3000;
var
  a:array[1..maxn,1..maxn] of longint;
  i,j,n,m,p,s:longint;
  f:boolean;
  st:ansistring;
begin
  assign(input,'string.in'); reset(input);
  assign(output,'string.out'); rewrite(output);
  readln(st);
  n:=length(st);
  m:=n;
  while st[m]<>'r' do
    dec(m);
  p:=1;
  while p<>m do
    begin
      while st[p]<>'r' do
        inc(p);
      f:=true;
      for i:=1 to p-3 do
        begin
          for j:=p to n do
            if (st[p-3]='b') and (st[p-2]='e') and (st[p-1]='a') and (st[p]='r')
              then if a[i,j]=0
                     then begin
                            inc(s);
                            a[i,j]:=1
                          end
                     else
              else begin
                     f:=false;
                     break
                   end;
          if f=false
            then break
        end;
      if p=m
        then break
        else inc(p);
    end;
  write(s);
  close(input); close(output)
end.