#include <iostream>
#include<math.h>
#include <algorithm>
#include<climits>
using namespace std;


struct skob
{
	char sk;
	skob *next;
};
class st
{
	skob *pbeg, *pend;
public:
	st() { pend = pbeg = NULL; }
	void push(char sko);
	char pop();
};
void st::push(char sko)
{
	skob *ptr = new skob;
	ptr->sk = sko; ptr->next = pbeg;
	pbeg = ptr;

}
char st::pop()
{
	if (!pbeg) return -1;
	skob *ptr = pbeg;
	char sko = pbeg->sk;
	pbeg = pbeg->next;
	delete ptr;
	return sko;
}
int main()
{
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);

	char q, t;
	st a, *pb;
	pb = new st;
	int i = 0, z = 0, counter = 0;
	skob close[1000];
	skob open[1000];
	while (cin >> q)
	{
		if ((q == 40) || (q == 91) || (q == 60) ||(q==123))
		{
			a.push(q);
			pb->push(q);
			z++;
		}
		else
		{
			t = pb->pop();
			if ((t == 40) && (q == 41))
				counter++;
			else if ((t == 91) && (q == 93))
				counter++;
			else if ((t == 60) && (q == 62))
				counter++;
			else if ((t == 123) && (q == 125))
				counter++;
		}
	}
	if (counter == z)
		cout << 1;
	else
		cout << 0;
}