#include <bits/stdc++.h>

const int N = 1e6 + 50;

int sel[N], type[N], cond[N], count[N];
std::vector<int> args[N], tr[N];
std::map<std::string, int> map;

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	int n, tot = 0;
	std::cin >> n;
	auto get = [&](std::string s) {
		if (!map.count(s))
			map[s] = ++tot;
		return map[s];
	};
	std::queue<int> que;
	for (int i = 1; i <= n; ++i) {
		std::string s;
		std::cin >> s;
		if (s != "if") {
			int o = get(s);
			sel[o] = 1;
			que.emplace(o);
		}
		else {
			std::string t, op;
			std::cin >> t;
			args[i].push_back(get(t));
			while (1) {
				std::cin >> op >> t;
				if (op == "or") type[i] = 1;
				else if (op == "and") type[i] = 2;
				else {
					cond[i] = get(t);
					break;
				}
				args[i].push_back(get(t));
			}
			for (int j : args[i])
				tr[j].push_back(i);
			if (!type[i])
				type[i] = 2;
			//assert(type[i] == 1 || type[i] == 2);
		}
	}
	while (!que.empty()) {
		int o = que.front(); que.pop();
		for (int t : tr[o]) {
			assert(type[t] == 1 || type[t] == 2 || type[t] == -1);
			if (type[t] == -1) continue;
			if (type[t] == 1) { // or
				type[t] = -1;
				if (!sel[cond[t]]) {
					sel[cond[t]] = 1;
					que.emplace(cond[t]);
				}
			}
			else {
				++count[t];
				if (count[t] == args[t].size()) {
					type[t] = -1;
					if (!sel[cond[t]]) {
						sel[cond[t]] = 1;
						que.emplace(cond[t]);
					}
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i <= tot; ++i)
		if (sel[i])
			++ans;
	printf("%d\n", ans);
}