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 position of all the alphabetical elements in the given list in order. Assume the position of the 1st element to be 1. Return -1 if no alphabetical element is in the list.

['6991', '5147', '2615', '949', 'd', '4081', 'C', 'z', '5293', '1291', '5891', 'S', '1949', '4859', 'O', '7453', '9791', '7333', '329', 'J', 't', '9857', 'O', '4785', '2657', '3811', '3763', 'Z', '15', '1859', '6399', '1567']
Output:
5, 7, 8, 12, 15, 20, 21, 23, 28