#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll q;
  cin >> q;
  set<ll> v;
  set<pair<ll, ll>> e;
  set<tuple<ll, ll, ll>> f;
  rep(qi, q) {
    ll a, b, c;
    cin >> a >> b >> c;
    v.insert(a);
    v.insert(b);
    v.insert(c);
    e.emplace(a, b);
    e.emplace(b, c);
    e.emplace(a, c);
    f.emplace(a, b, c);
  }
  ll ans = ll(v.size());
  ans -= ll(e.size());
  ans += ll(f.size());
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}