B'We call a string good, if after merging all the consecutive equal characters, the resulting string is palindrome. For example, "aabba" is good, because after the merging step it will become "aba". Given a string, you have to find two values: The first line of the input contains a single string of length n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). Each character of the string will be either 'a ' or 'b '. Print two space-separated integers: the number of good substrings of even length and the number of good substrings of odd length. In example 1, there are three good substrings ("b", "b", and "bb"). One of them has even length and two of them have odd length. In example 2, there are six good substrings (i.e. "b", "a", "a", "b", "aa", "baab"). Two of them have even length and four of them have odd length. In example 3, there are seven good substrings (i.e. "b", "a", "b", "b", "bb", "bab", "babb"). Two of them have even length and five of them have odd length. Definitions A substring s[l, xe2 x80 x89r] (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) of string s xe2 x80 x89= xe2 x80 x89s1s2... sn is string slsl xe2 x80 x89+ xe2 x80 x891... sr. A string s xe2 x80 x89= xe2 x80 x89s1s2... sn is a palindrome if it is equal to string snsn xe2 x80 x89- xe2 x80 x891... s1.'...