#include<bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define drep(x,y,z) for(int x=y;x>=z;x--)
#define ull unsigned long long
#define ll long long
using namespace std;
inline int read()
{
	int x=0;bool flag=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')flag=0;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
	if(flag) return x;
	return ~(x-1);
} 
inline void write(int x)
{
	if(x<0) {x=~(x-1);putchar('-');}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
///////////////////////
const int N=1e6;
string s;
struct que
{
	int s;
	char f;
}a[N+500];
int sz;
int ans1,ans0;
int main()
{
    freopen("csp2022pj_expr.in","r",stdin);
	freopen("csp2022pj_expr.out","w",stdout);
	cin>>s;
	a[++sz].s=0;
	a[sz].f='|';
	int z=0;
//	int zp;
	for(int i=0;i<s.length();i++)
	{
		if(s[i]=='0'||s[i]=='1') 
		{
			if(a[sz].f=='|') a[sz].s|=(s[i]-'0');
			else a[sz].s&=(s[i]-'0');
		}
		else if(s[i]=='|')
		{
			if(a[sz].s==1)
			{
				ans1++;
				z=0;
				while(z>=0||i<s.length())
				{
					i++;
//					if(s[i]!='&'&&z==0)
//					{
//						if(s[i]=='(') zp=i;
//						if(s[i]=='0'||s[i]=='1') zp=i;
//					}
//					if(s[i]=='&'&&z==0)  
//					{
//						i=zp; 
//						break;
//					}
					if(s[i]=='(') z++;
					if(s[i]==')') z--;
				}
				i--;
			}
			else 
			{
				if(s[i+2]=='&')
				{
					a[++sz].s=s[i+1]-'0';
					i++;
				}
				else a[sz].f='|';
			}
		}
		else if(s[i]=='&')
		{
			if(a[sz].s==1)
			{
				if(s[i+2]=='|')
				{
					a[sz].s=s[i+1]-'0';
					if(a[sz-1].f=='|') a[sz-1].s|=a[sz].s;
					else a[sz-1].s&=a[sz].s;
					sz--;
					i++;
				}
				else a[sz].f='&';
			}
			else
			{
				ans0++;
				z=0;
				while(z>=0||i<s.length())
				{
					i++;
					if(s[i]=='|'&&z==0) break;
					if(s[i]=='(') z++;
					if(s[i]==')') z--;
				}
				i--;
			}
		}
		else if(s[i]=='(')
		{
			a[++sz].s=0;
			a[sz].f='|';
		}
		else if(s[i]==')')
		{
			if(a[--sz].f=='|') a[sz].s|=a[sz+1].s;
			else a[sz].s&=a[sz+1].s;
		}
	}
	cout<<a[sz].s<<endl;
	cout<<ans0<<" "<<ans1<<endl;
    return 0;
}