Your friend Max has written a string S in your textbook. The string consists of lowercase latin letters. The problem is that Max is not good at writing at all! Especially, you never know if he wanted to write "w" or two consecutive "v". Given the string S, return the minimum and maximum length of a word which can be represented by it. The input string represents what you initially think the word is.

Input format:

In the first line there is a single integer N denoting the length of word S.
In the second line there is string S itself.

Output format:

Print the minimum and the maximum length of a word which can be represented by S. Output these numbers in one line and separate them by a single space.

Constraints:

N ≤ 10^6

SAMPLE INPUT
5
avwvb

SAMPLE OUTPUT
4 6

Explanation

The shortest word which can be represented by this string is awwb, while the longest is avvvvb
tc = input()
data = raw_input()
other = ""
max1 = 0
for char in data:
	if char == 'w':
		max1 += 2
		other += 'vv'
	elif char == 'v':
		max1 += 1
		other += 'v'
	else:
		other += char
		max1 += 1

i = 1
min1 = max1
while i < max1:
	if other[i-1] == "v" and other[i] =="v":
		min1 -= 1
		i += 2
	else:
		i+= 1
#print other
print min1, max1