def solve():
    n = int(input())
    al = [int(i) for i in input().split()]
    am = max(al)
    ami = al.index(am)
    res = n - 1
    while am != al[0]:
        am = max(al[:ami])
        ami = al.index(ami)
        res -= 1
    print(res)

if __name__=="__main__":
    solve()