#include<iostream>
#include<cctype>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;


//if the leter a is an ascender
bool ascender(char a)
{
	const string ascend_ch="bdfhk";
	return ascend_ch.end()-find(ascend_ch.begin(),ascend_ch.end(),a);
}
//if the word s is an ascender
bool is_ascender(const string s)
{
	return s.end()-find_if(s.begin(),s.end(),ascender);
}

vector<string> split_ascender(const string& s)
{
	vector<string> ret;
	typedef string::size_type string_size;
	string_size i=0;

	//ivarinant: we have processed characters [original value of i, i)
	while(i!=s.size())
	{
		//ignore leading blanks
		//invariant: characters in range [original i, current i) are all spaces
		while(i!=s.size()&&isspace(s[i]))
			++i;
		//find end of next word
		string_size j=i;
		//invariant: none of the characters in range [original j,current j)is a space
		while(j!=s.size()&&!isspace(s[j]))
			j++;
		//if we found some nonwhitespace characters
		if(i!=j)
		{
			string word=s.substr(i,j-i);
			//copy from s starting at i and taking j-i chars
			if(is_ascender(word))		//put word into vector
				ret.push_back(word);
			i=j;
		}
	}
	return ret;
}

string::size_type width(const vector<string>& v)
{
	string::size_type maxlen=0;
	for(vector<string>::size_type i=0;i!=v.size();++i)
		maxlen=_MAX(maxlen,v[i].size());
	return maxlen;
}




int main()
{
	string s;
	getline(cin,s);
	
	vector<string> v=split_ascender(s);

	for(vector<string>::size_type i=0;i<v.size();++i)
		cout<<v[i]<<endl;

	cout<<"the longest length of ascenders is__"<<width(v)<<endl;
	return 0;
}