Saara's Best Friend

3.7

3 votes
Very-Easy
Problem

Saara and her best friend are now completing their colleges and both will part to different cities pursuing higher education.Saara will obviously study Computer Science while her best friend will study quantum physics ...

However, as Saara didn't want to lose contact with her, she decided to mix Quantum Physics and Computer Science one last time and amaze her friend with Computer Science, so she could have a geek coding partner. To amaze her, she presented to her friend with a string S. Now , your task is simple. Given a string S of length N, you have to count the number of vowels k present in S. You need to print the value of k2 and the number of distinct characters in the string. [Case-Sensitive]

Input

There will be one single line of input corresponding to the string S.

Output

Print 2 space separated integers as mentioned in the question.

Constraints

1  ≤  N ≤ 106

Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation

There are 3 vowels in the string {e,o,o} (32=9).

There are 7 distinct characters in the string {H,e,l,o,W,r,d}.

Editor Image

?