**题目大意:** Haiku是日本传统诗歌的一种流派。 这种诗歌由三个短句组成,共有17个音节。 其中,第一个短句有5个音节,第二个短句有7个音节,第三个短句有5个音节。 为了简化问题,短句的音节数视为这个短句中的元音字母数。 只有以下字母被视为元音字母:“a”,“e”,“i”,“o”和“u”。 任务:给出一首诗,判断它是不是Haiku。 **INPUT:** 输入数据由三行组成。每行长度在1~100之间,由小写英文字母组成。允许有空格前缀或空格后缀。每个短句中至少有一个小写字母。 **OUTPUT:** 如果这首诗是Haiku,输出“YES”,否则输出“NO”。


Haiku is a genre of Japanese traditional poetry. A haiku poem consists of 17 syllables split into three phrases, containing 5, 7 and 5 syllables correspondingly (the first phrase should contain exactly 5 syllables, the second phrase should contain exactly 7 syllables, and the third phrase should contain exactly 5 syllables). A haiku masterpiece contains a description of a moment in those three phrases. Every word is important in a small poem, which is why haiku are rich with symbols. Each word has a special meaning, a special role. The main principle of haiku is to say much using a few words. To simplify the matter, in the given problem we will consider that the number of syllable in the phrase is equal to the number of vowel letters there. Only the following letters are regarded as vowel letters: "a", "e", "i", "o" and "u". Three phases from a certain poem are given. Determine whether it is haiku or not.



The input data consists of three lines. The length of each line is between $ 1 $ and $ 100 $ , inclusive. The $ i $ -th line contains the $ i $ -th phrase of the poem. Each phrase consists of one or more words, which are separated by one or more spaces. A word is a non-empty sequence of lowercase Latin letters. Leading and/or trailing spaces in phrases are allowed. Every phrase has at least one non-space character. See the example for clarification.


Print "YES" (without the quotes) if the poem is a haiku. Otherwise, print "NO" (also without the quotes).


输入样例 #1

on  codeforces 
beta round is running
   a rustling of keys 

输出样例 #1


输入样例 #2

how many gallons
of edo s rain did you drink

输出样例 #2