#include<bits/stdc++.h>
using namespace std::ranges;
using std::cin, std::cout;
const int N = 10000;
std::vector<int> a[N], b[N];
std::map<std::string, int> map;
std::string li[N];
int s[N];
int cc;
std::mt19937 gen;
int get(std::string s) {
	if(map.count(s)) return map[s];
	li[++cc] = s;
	return map[s] = cc;
}
std::vector<int> dl[N], l[N];
std::queue<int> Q;
int inq[N], cnt[N];
void flip(int x) {
	s[x] ^= 1;
	if(s[x]) {
		for(int t : l[x]) {
			cnt[t] += 1;
		}
		for(int t : dl[x]) {
			cnt[t] -= 1;
			if(cnt[t] * 3 <= a[t].size() + b[t].size() && !inq[t]) {
				inq[t] = 1, Q.push(t);
			}
		}
	} else {
		for(int t : l[x]) {
			cnt[t] -= 1;
			if(cnt[t] * 3 <= a[t].size() + b[t].size() && !inq[t]) {
				inq[t] = 1, Q.push(t);
			}
		}
		for(int t : dl[x]) {
			cnt[t] += 1;
		}
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int n; cin >> n;
	for(int i = 0;i < n;++i) {
		int m; cin >> m;
		for(int j = 0;j < m;++j) {
			std::string t; cin >> t;
			if(t[0] == '+') {
				t.erase(t.begin()), a[i].push_back(get(t));
			} else {
				t.erase(t.begin()), b[i].push_back(get(t));
			}
		}
		for(int x : a[i]) l[x].push_back(i);
		for(int x : b[i]) dl[x].push_back(i);
	}
	for(int i = 1;i <= cc;++i) {
		s[i] = gen() % 2;
	}
	for(int i = 0;i < n;++i) {
		for(int x : a[i]) cnt[i] += s[x];
		for(int x : b[i]) cnt[i] += !s[x];
		if(cnt[i] * 3 <= a[i].size() + b[i].size()) {
			Q.push(i), inq[i] = 1;
		}
	}
	for(;Q.size();) {
		int i = Q.front(); Q.pop(); inq[i] = 0;
		for(;cnt[i] * 3 <= (int) a[i].size() + b[i].size();) {
			if(gen() % 2 && a[i].size() || !b[i].size()) {
				int x = a[i][gen() % a[i].size()];
				if(s[x]) continue;
				flip(x);
			} else {
				int x = b[i][gen() % b[i].size()];
				if(!s[x]) continue;
				flip(x);
			}
		}
	}
	for(int i = 1;i <= cc;++i) if(s[i]) {
		cout << li[i] << '\n';
	}
}