Shortest Word Finder

Given a sentence, your task is to determine the shortest word in it. A word is defined as any sequence of characters separated by whitespace. In case of ties, output the word that appears first.

You can represent the sentence as a sequence \(w_1, w_2, \ldots, w_n\) and you need to find \(w_k\) such that \(|w_k| = \min_{1 \leq i \leq n} |w_i|\), where \(|w_i|\) denotes the length of the word.

inputFormat

The input is provided via standard input (stdin) as a single line containing a sentence.

outputFormat

Output the shortest word to standard output (stdout). If there are multiple words with the same minimum length, output the first one encountered.

The quick brown fox jumps over the lazy dog

The