#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 20;
const double pi = 3.141592653;
const double ME = 2.71828;
void LOSER() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void file() { freopen("records.in", "r", stdin); }
long long gcd(long long a, long long b) { return (!b) ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long Fib_recur(long long n) {
  vector<long long> v(n + 5, 0);
  v[1] = 0;
  v[2] = 1;
  for (int i = int(3); i <= int(n); i++) v[i] = v[i - 1] + v[i - 2];
  return v[n];
}
bool isprime(int n) {
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
void Solve() {
  int n, after = 0, befor = 0;
  bool f = 0;
  string s;
  cin >> n;
  while (n--) {
    cin >> s >> befor >> after;
    if (after > befor && befor >= 2400) {
      f = 1;
      break;
    }
  }
  (f) ? cout << "YES\n" : cout << "NO\n";
}
int main() {
  LOSER();
  Solve();
}
