vocale

n sentences are given. Each sentence is made up of lowercase English alphabet letters and spaces. The words in the sentences are separated by one or more spaces. From each sentence we take a single word and make a special sentence, so that any two consecutive words are separated by a single space. In the special sentence the first word is from the first sentence, the second word is from the second sentence, ..., the last word is from the last sentence.

Task

Determine a special sentence that contains a minimum number of vowels, as well as the number of such sentences.

Input Data

Input file vocale.in contains on line one number n, and on the following n lines the sentences (each sentence on one line).

Output Data

Output file vocale.out will contain the required sentence on line one and on line two the number in the request modulo 2003.

Constraints and Statements

1<=n<=250
All sentences have a maximum of 255 characters.
After each sentence there is an end of line character.
Each sentence contains at least one word.
Letters a, e, i, o, u represent the vowels.
The output file will contain a single special sentence, any of the existing ones.
For all input files the number in the task is <=2000000000.
x modulo 2003 represents the remainder of dividing x to 2003.

Example

vocale.in	vocale.out	Explanation
3 ana merge la mare si la munte dina se joaca mircea danseaza cu anita	la se cu 2	There are two special sentences with a minimum number of vowels: la se cu si se cu

Time limit: 0.1 seconds/test

prof. Doru Popescu Anastasiu
"Radu Greceanu" National College Slatina
Contact:dopopan@yahoo.com