#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);i++)
#define drep(i,a,b) for (register int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	string s; cin>>s; int n=s.size(); s=" "+s;
	
	unordered_map<int,int> mp;
	vector<int> p{1,2,3,3,4,2};
	vector<array<int,5> > nxt(n+2);
	
	mp['b']=1,mp['e']=2,mp['s']=3,mp['i']=4;
	rep(i,0,4) nxt[n+1][i]=n+1;
	drep(i,n,0)
	{
		nxt[i]=nxt[i+1];
		nxt[i][mp[s[i]]]=i;
	}
	
	vector<ll> t(n+2);
	auto lowbit=[&](int x){return x&(-x);};
	auto update=[&](int x,ll y){while (x<=n) t[x]+=y,x+=lowbit(x);};
	auto getsum=[&](int x){ll res=0; while (x) res+=t[x],x-=lowbit(x); return res;};
	auto query=[&](int l,int r){return getsum(r)-getsum(l-1);};
	
	rep(i,1,n) update(i,1);
	
	ll ans=0,lst=0;
	rep(i,1,n) if (s[i]=='b')
	{
		int cur=i-1;
		for (auto x:p)
		{
			if (cur==n+1) continue;
			cur=nxt[cur+1][x];
		}
		if (cur==n+1) continue;
		ll v=query(lst+1,i);
		ans+=v*(n-cur+1);
		update(cur+1,v);
		lst=i;
	}
	cout<<ans<<endl;

	return 0;
}