def partial_match_table(word):
    table = [0] * (len(word) + 1)
    table[0] = -1
    i, j = 0, 1

    while j < len(word):
        matched = word[i] == word[j]

        if not matched and i > 0:
            i = table[i]
        else:
            if matched:
                i += 1
            j += 1
            table[j] = i

    return table
    
def kmp_search(text, word):
    table = partial_match_table(word)
    i, p = 0, 0

    while i < len(text) and p < len(word):
        if text[i] == word[p]:
            i += 1
            p += 1
        elif p == 0:
            i += 1
        else:
            p = table[p]

    return (-1, i - p)[p == len(word)]

def solve(n, a, s):
    a = a + a
    t = []
    for i in range(2 * n - 1):
        if a[i] < a[i + 1]:
            t.append('<')
        else:
            t.append('>')
    t = ''.join(t)
    return t.find(s)

n = int(input())
a = list(map(int,input().split()))
s = input()

print(solve(n, a, s))