#include using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; #define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep2(i, a, b) rep3(i, a, b, 1) #define rep1(i, n) rep2(i, 0, n) #define rep0(n) rep1(aaaaa, n) #define ov4(a, b, c, d, name, ...) name #define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__) #define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--) #define fore(e, v) for (auto &&e : v) #define all(a) begin(a), end(a) #define sz(a) (int)(size(a)) #define lb(v, x) (lower_bound(all(v), x) - begin(v)) #define eb emplace_back template bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; } template bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; } const int INF = 1e9 + 100; const ll INFL = 3e18 + 100; #define i128 __int128_t struct _ { _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); } } __; int main() { int Q; cin >> Q; vi X; string S; X.reserve(Q); S.reserve(Q); rep(Q) { int t; cin >> t; if (t == 1) { char c; cin >> c; S.push_back(c); if (!X.empty() && X.back() == -1) { X.push_back(-1); } else { switch (c) { case '(': X.push_back(0); break; case '|': if (!X.empty() && X.back() == 0) X.push_back(1); else X.push_back(-1); break; case ')': if (!X.empty() && X.back() == 1) X.pop_back(), X.pop_back(); else X.push_back(-1); break; } } } else { int c = S.back(); S.pop_back(); switch (c) { case '(': X.pop_back(); break; case '|': X.pop_back(); break; case ')': if (X.empty() || X.back() != -1) X.push_back(0), X.push_back(1); else X.pop_back(); break; } } cout << (X.empty() ? "Yes\n" : "No\n"); } }