#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define rep(i, n) for(i = 0; i < n; ++i)
#define inc_rep(i, a, n) for(i = a; i <= n; ++i)
#define dec_rep(i, n, a) for(i = n; i >= a; --i)
#define in(a) cin >> a
#define out(a, b) cout << a << b
#define print_vec(v)                              \
    for(auto it = v.begin(); it != v.end(); ++it) \
        cout << *it << " ";                       \
    cout << endl
#define print_vec2d(v)                       \
    for(int i = 0; i < v.size(); ++i) {      \
        for(int j = 0; j < v[i].size(); ++j) \
            cout << v[i][j] << " ";          \
        cout << endl;                        \
    }                                        \
    cout << endl
#define print_vecpair(v)              \
    for(int i = 0; i < v.size(); ++i) \
    cout << v[i].first << " " << v[i].second << endl
#define vin(v)                        \
    for(int i = 0; i < v.size(); ++i) \
    cin >> v[i]
#define v2din(v)                             \
    for(int i = 0; i < v.size(); ++i) {      \
        for(int j = 0; j < v[i].size(); ++j) \
            cin >> v[i][j];                  \
    }
#define vpairin(v)                      \
    for(int i = 0; i < v.size(); ++i) { \
        int a, b;                       \
        cin >> a >> b;                  \
        v[i] = make_pair(a, b);         \
    }
using namespace std;
using lint = long long;
using ull = unsigned long long;

bool isit(vector<string> vs) {
    bool akai, marui, okii, umai;
    akai = marui = okii = umai = false;

    for(string item : vs) {
        if(item == "akai") { akai = true; }
        else if(item == "marui") { marui = true; }
        else if(item == "okii") { okii = true; }
        else if(item == "umai") { umai = true; }
    }

    return akai && marui && okii && umai;
}

int main(void) {
    int i, j;
    int n;
    cin >> n;
    vector<vector<string>> vs(n, vector<string>(4));

    rep(i, n) {
        rep(j, 4) {
            cin >> vs[i][j];
        }
    }

    int cnt = 0;

    for(auto item : vs) {
        cnt += isit(item);
    }

    cout << cnt << "\n";

    return 0;
}