def main():
    n = int(input())
    s = input()
    v_count = [0] * (n + 1)
    for i in range(n):
        if s[i] == 'v':
            v_count[i + 1] = v_count[i] + 1
        else:
            v_count[i + 1] = v_count[i] - 1

    max_sub = [0] * (n + 1)
    max_sum = 0
    sum = 0
    for i in range(n + 1):
        max_sum = max(max_sum, sum)
        max_sub[i] = max_sum
        sum += v_count[i]
        if sum < 0:
            sum = 0

    fold_count = n - 1
    elm = 0
    for i in range(n):
        if s[i] == 'v':
            elm += max_sub[-1] - max_sub[i + 1]
        else:
            elm += max_sub[i] - max_sub[-1]

    print(fold_count, elm)

if __name__ == "__main__":
    main()