import java.util.*;

public class ParenMatch {

  private static boolean match(char open, char close) {
    if (open == '(' && close == ')')
      return true;
    if (open == '[' && close == ']')
      return true;
    if (open == '{' && close == '}')
      return true;
    return false;
  }
  
    
  public static void main(String []args) {
    CharStack s;
    s = new CharStack();
    Scanner scan = new Scanner (System.in);
    
    while (scan.hasNext()) {
      String inputString = scan.next();
      for (int i = 0; i<inputString.length(); i++) {
        char c = inputString.charAt(i);
        if (c == '(' || c=='[' || c=='{')
          s.push(c);
        else if (c==')' || c==']' || c=='}')
          if (s.isEmpty() || !match(s.pop(), c)) {
          System.out.println("Not matching!!!");
                return;
        }
      }
    }
    if (!s.isEmpty())
          System.out.println("Not everything is closed!!!");      
  }
}