n个人，每人有份，所有人排成一圈，发奖品，若某人高于左右，则奖品高于左右，每人至少一个奖品，求最少的奖品

  input:

N人

分数：x1 x2 x3 x4

output:

m

class Solution:
    def mini(self, N,A)->int:
        price={}
        index=A.index(min(A))
        price[index]=1
        i=0
        index=index+1
        while i<len(A)-1:
            
            if index==len(A)-1:
                #print("@@@")
                #print(index)
                if A[index]>A[index-1] and A[index]>A[0]:
                    price[index]=max(price[0],price[index-1])+1
                else:
                    price[index]=1
                index=0
            if A[index]>A[index-1] and A[index]>A[index+1]:
                price[index]=price[index-1]+1
            else:
                price[index]=1
            index=index+1
            i=i+1
            #print("%%%")
            #print(index)
            #print(price)
        sum_p=0
        for key in price:
            sum_p=sum_p+price[key]
        #print(sum_p)
        return sum_p

def stringToIntegerList(input):
    return json.loads(input)

def main():
    import sys
    import io
    def readlines():
        for line in io.TextIOWrapper(sys.stdin.buffer, encoding='utf-8'):
            yield line.strip('\n')

    lines = readlines()
    while True:
        try:
            line = next(lines)
            N = int(line);
            #print(N)
            line = next(lines)
            A=list()
            for i in range(0,line.__len__(),1): #(开始/左边界, 结束/右边界, 步长)         
                for word in line[i].split():
                    word=word.strip(string.whitespace)
                    A.append(word)
            #print(A)
            ret = Solution().mini(N,A)
            out = str(ret);
            print(out)
        except StopIteration:
            break

if __name__ == '__main__':
    main()