def f(s):
st = {"a", "e", "i", "o", "u"}
d = 0
for c in s:
if(c in st):
d += 1
return d
print(("NO","YES")[f(input()) == 5 and f(input()) == 7 and f(input()) == 5])
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// brute force?
map<char,int> m={{'a',1},{'e',1}
,{'i',1},{'o',1},{'u',1}};
vector<int> v={5,7,5};
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
// freopen("input.txt","r", stdin);
int idx=0;
for(string line; getline(cin, line);){
int sum=0;
for(char c:line){
if (m.count(c)) sum++;
}
if (sum!=v[idx]) {
cout << "NO"<<endl;
return 0;
}
idx++;
}
cout << "YES"<<endl;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |