#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll dp[11][156][22];
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int kkt; scanf("%d", &kkt);
	string s;
	ll cnt0 = 0;
	ll cnt1 = 0;
	while (kkt--) {
		ll p, n;
		char c;
		cin >> p >> c >> n;
		if (c == '(') cnt0 += n;
		else cnt1 += n;
		if (cnt0 == cnt1) puts("Yes");
		else puts("No");
		/*
		string t;
		for (int i = 0; i < p; i++) t += s[i];
		t += string(n, c);
		for (int i = p; i < s.size(); i++) t += s[i];
		s = t;
		*/
	}
	return 0;

}

