What is the worst-case time complexity of the following function assuming it is measured on value n rather than its logarithmic size?

from array_sorted_list import ArraySortedList
from sorted_list_adt import ListItem
def mystery(n: int) -> None:
    my_list = ArraySortedList(10)
    for i in range(10):
        my_list.add(ListItem(n, i)) # assume ListItem(n, i) is O(1)
        # ListItem(value, key) adds based on key