import java.util.Stack;

class Solution {
     boolean  solution(String s) {
        Stack<Character> stack = new Stack<>();

        for (int i = 0; i < s.length(); i++) {
            char parentheses = s.charAt(i);

            if ('(' == parentheses) {
                stack.add(parentheses);
            } else {
                if (stack.isEmpty()) return false;

                stack.pop();
            }
        }

        if (stack.isEmpty()) return true;
        return false;
    }
}