def index_of_2nd_largest(alist):
    second_largest=0
    largest=0
    n1=len(alist)

    i=0
    index=0
    while i< n1:

        if largest<alist[i]:
            largest=alist[i]
            n2=i

        elif second_largest<alist[i]:
            second_largest=alist[i]
            index=i



        i+=1
    return index