What's the time complexity of list access in Python?

Question

I\'m trying to make a python function as fast as I can. Let\'s suppose I have a prime list and I\'m calling primes[i] n times for the same i.

<