#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
int Q;
int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);
    std::cin >> Q;
    std::vector<int> A;
    A.reserve(3 * Q);
    std::vector<std::pair<int, int>> B;
    B.reserve(3 * Q);
    std::vector<std::tuple<int, int, int>> C;
    B.reserve(Q);
    while (Q--) {
        int a, b, c;
        std::cin >> a >> b >> c;
        std::vector<int> cur{ a, b, c };
        std::sort(cur.begin(), cur.end());
        for (int i = 0 ; i < 3 ; i++) A.push_back(cur[i]);
        B.push_back({cur[0], cur[1]});
        B.push_back({cur[1], cur[2]});
        B.push_back({cur[0], cur[2]});
        C.push_back({cur[0], cur[1], cur[2]});
    }
    std::sort(A.begin(), A.end());
    A.erase(std::unique(A.begin(), A.end()), A.end());
    std::sort(B.begin(), B.end());
    B.erase(std::unique(B.begin(), B.end()), B.end());
    std::sort(C.begin(), C.end());
    C.erase(std::unique(C.begin(), C.end()), C.end());
    std::cout << (int)A.size() - (int)B.size() + (int)C.size() << '\n';
}