#include <bits/stdc++.h>
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
void bad(int mes) {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
template <typename T>
void amax(T& x, T y) {
  x = max(x, y);
}
template <typename T>
void amin(T& x, T y) {
  x = min(x, y);
}
inline int popcount(int x) {
  int count = 0;
  __asm__ volatile("POPCNT %1, %0;" : "=r"(count) : "r"(x) :);
  return count;
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)1e5 + 12, base = 1e9 + 7;
const long long llinf = 2e18 + 5;
template <typename T>
T binpow(T n, T second) {
  if (second <= 0) return 1LL;
  if (second % 2 == 0) {
    T b = binpow(n, second / 2);
    return (1LL * b * b) % base;
  } else {
    return (1LL * binpow(n, second - 1) * n) % base;
  }
}
int a[maxn], l[maxn], r[maxn];
bool isroot[maxn];
pair<int, int> intersect(pair<int, int> r1, pair<int, int> r2) {
  return make_pair(max(r1.first, r2.first), min(r1.second, r2.second));
}
map<int, int> can_find, cnt;
void dfs(int v, pair<int, int> rng) {
  if (rng.first <= a[v] && a[v] <= rng.second) {
    can_find[a[v]] = 1;
  }
  pair<int, int> left_rng = intersect(make_pair(0, a[v] - 1), rng);
  pair<int, int> right_rng = intersect(make_pair(a[v] + 1, (int)1e9), rng);
  if (l[v] != -1) dfs(l[v], left_rng);
  if (r[v] != -1) dfs(r[v], right_rng);
}
int main() {
  int n;
  read(n);
  memset(isroot, 1, sizeof(isroot));
  for (int i = 0; i < n; i++) {
    read(a[i], l[i], r[i]);
    cnt[a[i]]++;
    if (l[i] != -1) l[i]--, isroot[l[i]] = 0;
    if (r[i] != -1) r[i]--, isroot[r[i]] = 0;
  }
  int root;
  for (int i = 0; i < n; i++)
    if (isroot[i]) root = i;
  dfs(root, make_pair(0, (int)1e9));
  int ans = 0;
  for (auto e : can_find) {
    ans += cnt[e.first];
  }
  cout << n - ans;
  return 0;
}
