Time Complexity of a function that iterates over n repeated digits

Question

Let\'s say I had a function

def f(n):

   for x in range(int("1" * n)):
       ....  # assume this step is o(1)

This function takes