#Define a word as a sequence of consecutive English letters. Find the longest word from the given string.

#Example

#For text = "Ready, steady, go!", the output should be
#longestWord(text) = "steady".

def longestWord(text):

	lista = list(text)
	long = len(lista)
	
	#print(lista)

	#Larger size of word
	larger = 0
	#Current Size of word
	currentSize = 0
	#Store current word
	word = []
	#Store max size word
	wordMax = []

	for i in range(long):
		if lista[i].isalpha():
			print(lista[i],' is a word')
			currentSize += 1
			print(currentSize,'-thm letter in word')
			word.append(lista[i])
			print('Appended')
		else:
			print(lista[i],' is NOT a word')
			if currentSize > larger:
				print('The previous word was', ''.join(word) ,'the larger. Of size ',currentSize)
				larger = currentSize
				wordMax = list(word)
				
			currentSize = 0
			word = []
	#We get to the end
	if currentSize > larger:
				print('The previous word was', ''.join(word) ,'the larger. Of size ',currentSize)
				larger = currentSize
				wordMax = list(word)
				word = []
	return ''.join(wordMax)