You will be given a definition of a task first, then some input of the task.
In this task, you are given an input list A. If the count of numbers is more than that of alphabets in the list, answer 'Numbers Win'. If the count of alphabets is more than that of numbers in the list, answer 'Alphabets Win'. If the count of numbers is same as that of alphabets in the list, answer 'Numbers and Alphabets are Tied'.

['I', 'L', '3895', '8887', 'U', 'x', '8481', 'E', 'R', '1959', 'N', 'i', 'Z', '1739', 'G', 'O', 'a', 'Q', 'n', '8207', 'x', 'A', 'u', '4803', 'q', 'A', 'K', '8905', '493', '5563', '13', '6143', 'Q', '8605', 'L', 'z', '6345', 'R', 'Q', '4939', 'Z', '601', '473', '1161', '1059', 'm', 'k']
Output:
Alphabets Win