class Solution

{

    public:

    //Function to check if brackets are balanced or not.

    bool ispar(string x)

    {

        // Your code here

        stack<char> st;

        for(int i=0; i<x.size(); i++){

            if(st.empty()) st.push(x[i]);

            else if(st.top()=='(' && x[i]==')' || st.top()=='{' && x[i]=='}' || st.top()=='[' && x[i]==']'){

                st.pop();

            }

            else{

                st.push(x[i]);

            }

        }

        if(st.empty()) return true;

        else return false;

    }

};