#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod (ll)(1e9+7);

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

string s;

int main()
{
	cin >> s;
	int right = 0,left = 0;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '*') {
			if (s[i + 1] == ')')left++;
			else if (s[i + 1] == '^')right++;
		}
	}
	cout << left << " " << right << endl;
	return	0;
}