Problem: 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:

  1. the number of good substrings of even length; 
  2. the number of good substrings of odd length. 

Input

The first line of the input contains a single string of length n (1 ≤ n ≤ 105). Each character of the string will be either 'a' or 'b'.

Output

Print two space-separated integers: the number of good substrings of even length and the number of good substrings of odd length.

Examples

Input

bb


Output

1 2


Input

baab


Output

2 4


Input

babb


Output

2 5


Input

babaa


Output

2 7

Note

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, r] (1 ≤ l ≤ r ≤ n) of string s = s1s2... sn is string slsl + 1... sr.

A string s = s1s2... sn is a palindrome if it is equal to string snsn - 1... s1.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class D implements Runnable {
	FastReader sc;
	PrintWriter out;
	long mod = (long)1e9 + 7;
	
	long gcd(long a,long b)
	{
		if(a == 0) return b;
		if(b == 0) return a;
		
		return gcd(b,a%b);
	}
	
	
	void solve() 
	{		
		
		int tc = 1;
		outer: while(tc-- > 0)
		{
			String s = sc.nln();
			
			
			ArrayList<Integer> arl = new ArrayList<>();
			int cnt = 0;
			for(int i = 0; i < s.length(); i++)
			{	
				if(i != s.length()-1)
				{
					if(s.charAt(i) == s.charAt(i+1))
					{
						cnt++;
					}
					else
					{	
						cnt++;
						arl.add(cnt);
						cnt = 0;
					}
				}
				else
				{
					cnt++;
				}
			}
			
			arl.add(cnt);
			
			int fo = 0;
			int fe = 0;
			int so = 0;
			int se = 0;
			
			cnt = 0;
			boolean f = true;
			
			fo = (arl.get(0)+1)/2;
			fe = arl.get(0)/2;
			
			long oa = 0L;
			long ea = 0L;
			
			for(int i = 1; i < arl.size(); i++)
			{
				if(i%2 == 1)
				{
					cnt = arl.get(i); //length of a
				}
				else
				{	
					int x = arl.get(i);
					int co = (x+1)/2;
					int ce = x/2;
					if(f)
					{	
						
						if(cnt%2 == 0)
						{	
							ea += 1L*fo*co + 1L*fe*ce;
							oa += 1L*fo*ce + 1L*fe*co;
							
							ea += 1L*so*ce + 1L*se*co;
							oa += 1L*so*co + 1L*se*ce;
						}
						else
						{
							ea += 1L*fe*co + 1L*fo*ce;
							oa += 1L*fe*ce + 1L*fo*co;
							
							ea += 1L*se*ce + 1L*so*co;
							oa += 1L*se*co + 1L*so*ce;
						}
					}
					else
					{
						if(cnt%2 == 0)
						{	
							ea += 1L*so*co + 1L*se*ce;
							oa += 1L*so*ce + 1L*se*co;
							
							ea += 1L*fo*ce + 1L*fe*co;
							oa += 1L*fo*co + 1L*fe*ce;
						}
						else
						{
							ea += 1L*se*co + 1L*so*ce;
							oa += 1L*se*ce + 1L*so*co;
							
							ea += 1L*fe*ce + 1L*fo*co;
							oa += 1L*fe*co + 1L*fo*ce;
						}
					}
					cnt += arl.get(i);//length of b
					
					if(cnt%2 == 0)
					{
						if(f)
						{
							fo += co;
							fe += ce;
							f = true;
						}
						else
						{
							so += co;
							se += ce;
							f = false;
						}
					}
					else
					{
						if(f)
						{
							so += co;
							se += ce;
							f = false;
						}
						else
						{
							fo += co;
							fe += ce;
							f = true;
						}
					}
				}
			}
			//System.out.println(oa+" "+ea);
			fo = 0;
			fe = 0;
			so = 0;
			se = 0;
			f = true;
			if(arl.size() > 1)
			{
				fo = (arl.get(1)+1)/2;
				fe = arl.get(1)/2;
			}
			
			for(int i = 2; i < arl.size(); i++)
			{
				if(i%2 == 0)
				{
					cnt = arl.get(i);
				}
				else
				{	
					int x = arl.get(i);
					int co = (x+1)/2;
					int ce = x/2;
					if(f)
					{	
						
						if(cnt%2 == 0)
						{	
							ea += 1L*fo*co + 1L*fe*ce;
							oa += 1L*fo*ce + 1L*fe*co;
							
							ea += 1L*so*ce + 1L*se*co;
							oa += 1L*so*co + 1L*se*ce;
						}
						else
						{
							ea += 1L*fe*co + 1L*fo*ce;
							oa += 1L*fe*ce + 1L*fo*co;
							
							ea += 1L*se*ce + 1L*so*co;
							oa += 1L*se*co + 1L*so*ce;
						}
					}
					else
					{
						if(cnt%2 == 0)
						{	
							ea += 1L*so*co + 1L*se*ce;
							oa += 1L*so*ce + 1L*se*co;
							
							ea += 1L*fo*ce + 1L*fe*co;
							oa += 1L*fo*co + 1L*fe*ce;
						}
						else
						{
							ea += 1L*se*co + 1L*so*ce;
							oa += 1L*se*ce + 1L*so*co;
							
							ea += 1L*fe*ce + 1L*fo*co;
							oa += 1L*fe*co + 1L*fo*ce;
						}
					}
					cnt += arl.get(i);//length of b
					
					if(cnt%2 == 0)
					{
						if(f)
						{
							fo += co;
							fe += ce;
							f = true;
						}
						else
						{
							so += co;
							se += ce;
							f = false;
						}
					}
					else
					{
						if(f)
						{
							so += co;
							se += ce;
							f = false;
						}
						else
						{
							fo += co;
							fe += ce;
							f = true;
						}
					}
				}
			}
			
			//System.out.println(oa+" "+ea);
			for(int i = 0; i < arl.size(); i++)
			{
				int x = arl.get(i);
				boolean odd = true;
				for(int j = x; j >= 1; j--)
				{
					if(odd)
					{
						oa += j;
					}
					else
					{
						ea += j;
					}
					
					odd = !odd;
				}
			}
			
			out.println(ea+" "+oa);
			
		}
	}
	

	//bbbabaaaaaabaaababbababaabaaa
	//bbbabaaaaaabaaa
	class Pair implements Comparable<Pair>
	{
		
		int x;
		int y;
		
		Pair(int x,int y)
		{
			this.x = x;
			this.y = y;
		}
		
		public int compareTo(Pair o) 
		{
			
			if(x != o.x)
			{
				if(x > o.x) return 1;  //increasing order
				else return -1;	
			}
			else
			{
				if(y > o.y) return 1;  //increasing order
				else return -1;	
			}
		}
	}

	public void run() 
	{
		out = new PrintWriter(System.out);
		sc = new FastReader();
		solve();
		out.flush();
	}

	public static void main(String[] args) 
	{
		new Thread(null, new D(), "Main", 1 << 28).start();
	}

	class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int ni() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nl() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nd() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nln() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
        

		int[] nia(int n) {
			int[] ar = new int[n];
			for (int i = 0; i < n; i++)
				ar[i] = ni();
			return ar;
		}
		
		long[] nla(int n) {
			long[] ar = new long[n];
			for (int i = 0; i < n; i++)
				ar[i] = nl();
			return ar;
		}

	    
		int[][] nim(int n, int m) {
			int[][] ar = new int[n][];
			for (int i = 0; i < n; i++) {
				ar[i] = nia(m);
			}
			return ar;
		}

		long[][] nlm(int n, int m) {
			long[][] ar = new long[n][];
			for (int i = 0; i < n; i++) {
				ar[i] = nla(m);
			}
			return ar;
		}
		
		String reverse(String s)
		{
			StringBuilder r = new StringBuilder(s);
			return r.reverse().toString();
		}
		
		void merge1(int arr[], int l, int m, int r)
	    {
	        int n1 = m - l + 1;
	        int n2 = r - m;
	        int L[] = new int [n1];
	        int R[] = new int [n2];
	        for (int i=0; i<n1; ++i)
	            L[i] = arr[l + i];
	        for (int j=0; j<n2; ++j)
	            R[j] = arr[m + 1+ j];
	        int i = 0, j = 0;
	        int k = l;
	        while (i < n1 && j < n2)
	        {
	            if (L[i]<=R[j])
	            {
	                arr[k] = L[i];
	                i++;
	            }
	            else
	            {
	                arr[k] = R[j];
	                j++;
	            }
	            k++;
	        }
	        while (i < n1)
	        {
	            arr[k] = L[i];
	            i++;
	            k++;
	        }
	        while (j < n2)
	        {
	            arr[k] = R[j];
	            j++;
	            k++;
	        }
	    }
	    void sort1(int arr[], int l, int r)
	    {
	        if (l < r)
	        {
	            int m = (l+r)/2;
	            sort1(arr, l, m);
	            sort1(arr , m+1, r);
	            merge1(arr, l, m, r);
	        }
	    }
    }
}