#include <bits/stdc++.h>
using namespace std;

int main() {
    using T = tuple<int, int, int>;
    set<T> s;
    
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int a[3];
        for (int j = 0; j < 3; ++j) cin >> a[j];
        sort(a, a + 3);
        s.insert(tie(a[0], a[1], a[2]));
    }
    cout << n - s.size() << endl;
}