#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool f(string s)
{ int j,k;
  stack <char> t;
  string open = "([{<",
        close = ")]}>";
  for (j=0; j<s.size(); j++)
  { if        ((0<= open.find(s[j])) && ( open.find(s[j])<5)) t.push(s[j]);
    else { if ((0<=close.find(s[j])) && (close.find(s[j])<5))
           { if (t.size() == 0) return false;
             k = close.find(s[j]);
             if (t.top() == open[k]) t.pop();
             else return false;
           }
         }
  }
  return (t.size() == 0);
}

int main()
{ cout<<f("[{([[[<>]]])(<>)(){}}]")
      <<f("]()(){<>}[[()]]")
      <<f("[(sjd),'2'],{2:3}, [<>]")
      <<f("{[[[[((()))]]<]>]}")<<endl;
  return 0;
}