#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>
#include <string>

using namespace std;

bool isletter(char c)
{
	return ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z');
}

int whichletter(char c)
{
	return ('a' <= c && c <= 'z') ? c - 'a' : c - 'A';
}

int main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, i, ans = 0;
	cin >> n;
	cin.ignore();

	while (n--)
	{
		string sentence;
		getline(cin, sentence);
		vector<int> cnt(26, 0);

		for (i = 0; i < sentence.size(); i++)
		{
			if (isletter(sentence[i])) if (++cnt[whichletter(sentence[i])] > 2) break;
		}
		ans += i == sentence.size();
	}
	cout << ans;
}