#include<iostream>
#include<stack>
#include<string>using namespace std;bool Judge(string str) {  //使用栈判断括号匹配stack <char>s;for (int i = 0; i < str.length(); i++) {switch (str[i]) {case '(':s.push('(');break;case '[':s.push('[');break;case '{':s.push('{');break;case ')':if (s.top() == '(') {s.pop();}else {return false;}break;case ']':if (s.top() == '[') {s.pop();}else {return false;}break;case '}':if (s.top() == '{') {s.pop();}else {return false;}break;}}if (s.empty()) {return true;}else {return false;}
}int main() {string str;cin >> str;cout << Judge(str) << endl;system("pause");return 0;}/*
[([][])]{()}
[(){]}
*/