The youngest
                                         
                                         
                            
                             
                                         
                                          Problem 
                         
                                 Some list contains information about the year of birth of each of the 
N people. Determine the highest ordinal number of the youngest person (counting from 1). 
Input
The first line contains the number 
N - the number of people (
0<N<=50). The second line contains the year of birth 
N people ( 
N numbers).
Imprint
Output the largest number of the youngest person.
 
Example
| # | Input | Output | 
| 1 | 5 1904 1903 1905 1905 1903
 | 4 | 
Запрещенные операторы: sort; min; max; reverse