Under construction

Still being built. Things may change

Is Y a Vowel?

Time limit1sMemory limit2048 MB

Summary
Given a lowercase word, count its vowels twice: once without counting y and once counting y as a vowel.
Level

Easy1 of 10

Topics
String, Implementation
Solved
No attempts yet

Problem

The vowels are a, e, i, o, and u, and possibly y. People disagree on whether y is a vowel. Unfortunately for you, you have been tasked with counting the vowels in a word. You must count how many vowels there are assuming y is a vowel, and assuming it is not.

Input

The single line of input contains a string of at least one and at most 50 lowercase letters.

Output

Output two space-separated integers. The first is the number of vowels assuming y is not a vowel, and the second is the number of vowels assuming y is a vowel.

Examples1

  1. Example 1

    Input
    asdfiy
    
    Expected output
    2 3