Big O running time for this algorithm[function call from within a loop]?

Question

So the basic doubt i had started with this piece of code

def fn2(a,n):
    .
    .
    for i in range(0,n):
        .
        .
        .

def fn1():
    .
    .
    for i in range(1,n+1):
        fn2(a,i)

Would this be considered as a loop within a loop or will this take more than the usual O(n²) or would it take greater time then that ?