Accept a sequence of words as input and print the shortest word in the sequence.
Input
The input will have n + 1 lines, where n denotes the number of words in the
sequence. The i-th line of the input contains the i-th word. The last line of the
input will always be the string abcdefghijklmnopqrstuvwxyz; it marks the end of
the input and is not a part of the sequence. Every sequence has at least one word.
Output
A single word: the shortest word in the sequence. If several words share the minimum length, print the first such word.
Write a complete program: read the input with input() and print the result with print().
Input
apple
banana
kiwi
abcdefghijklmnopqrstuvwxyz
Output
kiwi