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. You need to convert all the alphabets in the list with a number representing their position in the English alphabet. E.g., replace A by 1, B by 2, a by 1, b by 2, and so on.

['I', '1091', 'R', 'G', '5169', '6593', 'Y', '6615', 'J', '7077', '8885', 'D', 'b', '6047', 'q', 'C', '9025', 'E', 'n', '9379', 'e', 'v', '6047', '7523', '9251', '1627', '7111', 'F']
Output:
9, 1091, 18, 7, 5169, 6593, 25, 6615, 10, 7077, 8885, 4, 2, 6047, 17, 3, 9025, 5, 14, 9379, 5, 22, 6047, 7523, 9251, 1627, 7111, 6