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.
import java.io.*;
import java.util.*;
import java.math.*;

 
 public class Main	{
   static class Pair implements Comparable<Pair>{
   int a;
   int b;
   public Pair(int x,int y){a=Math.min(x, y);b=Math.max(x, y);}
   public Pair(){}
   public int compareTo(Pair p){
	 return p.a - a;
   }
@Override
public int hashCode() {
	final int prime = 31;
	int result = 1;
	result = prime * result + a;
	result = prime * result + b;
//	out.println("hashcode = "+result);
	return result;
}
@Override
public boolean equals(Object obj) {
	Pair cur = (Pair)obj;
	if((a==cur.a && b==cur.b) || (a==cur.b && b==cur.a))return true;
	return false;
}
 }
   static class cell implements Comparable<cell>{
	   int a,b;
	   long dis;
	   public cell(int x,int y,long z) {a=x;b=y;dis=z;}
	   public int compareTo(cell c) {
		   return Long.compare(dis,c.dis);
	   }
   }
static class TrieNode{
	TrieNode left;
	TrieNode right;
	int op;
	int data;
	public TrieNode() {}
}
  public static long gcd(long a,long b)
  {
    if(a<b)

      return gcd(b,a);
    if(b==0)
      return a;
    return gcd(b,a%b);
    
  }
  static long lcm(long a,long b) {
	  return a*b / gcd(a,b);
  }
  //static long ans = 0;
  static long mod = (long)1e8;//(long)(1e9+7);///998244353;
   
    public static void main(String[] args) throws Exception {
       new Thread(null, null, "Anshum Gupta", 99999999) {
            public void run() {
                try {
                    solve();
                } catch(Exception e) {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }

static long pow(long x,long y){
    if(y == 0)return 1;
    if(y==1)return x;
    long a = pow(x,y/2);
    a = (a*a)%mod;
    if(y%2==0){
        return a;
    }
    return (a*x)%mod;
}

static long mxx;
static int mxN = (int)(3e5+5);
static long[]fact,inv_fact;
static long my_inv(long a) {
	return pow(a,mod-2);
}
static long bin(int a,int b) {
	if(a < b || a<0 || b<0)return 0;
    return ((fact[a]*inv_fact[a-b])%mod * inv_fact[b])%mod;
}
//static ArrayList<ArrayList<Integer>>adj;
//static boolean[]vis;
static void make_facts() {
  fact=new long[mxN];
  inv_fact = new long[mxN];
  fact[0]=inv_fact[0]=1L;
  for(int i=1;i<mxN;i++) {
	   fact[i] = (i*fact[i-1])%mod;
	   inv_fact[i] = my_inv(fact[i]);
  }
}
//static int[]bfs(int a){
//	Queue<Integer> q = new  LinkedList<Integer>();
//	
//	vis = new boolean[n+1];
//	int[]dis = new int[n+1];
//	q.add(a);
//	dis[a] = 0;
//	vis[a] = true;
//	while(!q.isEmpty()) {
//		int cur = q.poll();
//	//	vis[cur] = true;
//	//	if(cur == b)break;
//		for(int x : adj.get(cur)) {
//			if(vis[x])continue;
//			q.add(x);
//			dis[x] = dis[cur]+1;
//			vis[x] = true;
//		}
//	}
//	return dis;
//}

 public static void solve() throws Exception {
   // solve the problem here
   MyScanner s = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        int tc = 1;//s.nextInt();
        mxx = (long)(1e18+5);
//        make_facts();  
        while(tc-->0){
        	String str = s.next();
        	int n = str.length();
        	long[]odd = new long[2];
        	long[]even = new long[2];
	        long o = 0, e = 0;	
            for(int i=0;i<n;i++) {
            	o++;
            	int id = str.charAt(i)-'a';
            	if(i % 2 == 0) {
            		o += even[id];
            		e += odd[id];
            		even[id]++;
            	}
            	else {
            		e += even[id];
            		o += odd[id];
            		odd[id]++;
            	}
            }
            
            out.println(e + " "+ o);
        }
        	
           
        out.flush();
}
 
     
 
 
 
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
 
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public MyScanner() {
            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 nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        double nextDouble() { return Double.parseDouble(next()); }
         
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    //--------------------------------------------------------
}
