#include <bits/stdc++.h>
using namespace std;
unsigned long long int MOD = 1000000007;
unsigned long long int B = 13331;
bool cmp(const int &a, const int &b) { return a < b; }
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
unsigned long long int int_mod(unsigned long long int a) {
  return (a + MOD) % MOD;
}
unsigned long long int power_expo(unsigned long long int a,
                                  unsigned long long int b) {
  unsigned long long int t;
  if (b == 0) return 1;
  if (b == 1) return int_mod(a);
  t = power_expo(a, b / 2);
  return b % 2 == 0 ? int_mod(t * t) : int_mod(int_mod(t * t) * a);
}
int main() {
  int i, j, k;
  int n;
  cin >> n;
  string s[105];
  int flag = 0;
  for (i = 0; i < n; i++) {
    cin >> s[i];
    int a, b;
    cin >> a >> b;
    if (a >= 2400 && b >= 2400 && b > a) flag = 1;
  }
  if (flag)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
