#include using namespace std; template istream &operator>>(istream &is, vector &v) { for (T &in : v) is >> in; return is; } template ostream &operator<<(ostream &os, const vector &v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != (int)v.size() ? " " : ""); return os; } #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP1(i, n) for (auto i = std::decay_t{}; (i) != (n); ++(i)) #define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i)) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__) #define sum(l) accumulate(l.begin(), l.end(), 0) #define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__) #define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__) using ull = unsigned long long; using ll = long long; using vi = vector; using vl = vector; using vll = vector; using vvi = vector; using vvl = vector; using vvll = vector; using vs = vector; using pii = pair; using vpii = vector; int main() { cin.tie(0); ios::sync_with_stdio(false); int q; cin >> q; string s; vi hist; s.reserve(q); hist.reserve(q); rep(i, q) { int t; cin >> t; if (t == 1) { char c; cin >> c; if (c == ')' && s.size() >= 2 && s[s.size()-2] == '(' && s[s.size()-1] == '|') { s.pop_back(); s.pop_back(); hist.push_back(1); } else { s.push_back(c); hist.push_back(0); } } else { int x = hist.back(); hist.pop_back(); if (x == 0) { s.pop_back(); } else { s.push_back('('); s.push_back('|'); } } cout << (s.empty() ? "Yes" : "No") << '\n'; } return 0; }