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 list contains several comma-separated items written within brackets. You need to return the count of all the alphabetical elements in the given list. Return 0 if no alphabetical element in the list

['X', 'l', 'U', 'N', 'j', 'X', '4955', 'L', '469', '1401', '1313', 'H', 'X', '2895', '4283', 'z', '3193', '1661', 'X', '7601', '795', '127', 'V', 'o', 'R', 'Z', '7569', 'U', '8479', 'L', '711', 'v', '4721', '9059', '1043', 'g', '4839']
Output:

Show your work and conclude with the exact phrasing "Therefore, the final answer is [answer]." where [answer] is just the final number or expression that solves the problem.
user
19