#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int INFINITE = 0x3f3f3f3f;
template <class T>
inline void swap(T &a, T &b) {
  T temp = a;
  a = b;
  b = temp;
}
template <class T>
inline void checkmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline T lowbit(T n) {
  return (n ^ (n - 1)) & n;
}
template <class T>
inline int countbit(T n) {
  return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline T gcd(T a, T b) {
  T c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
template <class T>
inline T inv(T a, T b) {
  return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
typedef vector<int> VI;
typedef vector<VI> VII;
typedef vector<string> VS;
inline int solve(int testnum) {
  int n;
  cin >> n;
  int res = 0;
  for (int i = (0); i < int(n); i++) {
    string name;
    int b, a;
    cin >> name >> b >> a;
    if (b >= 2400 && a > b) ++res;
  }
  cout << (res ? "YES" : "NO") << endl;
  return 0;
}
int main(int argc, char *argv[]) {
  ios::sync_with_stdio(false);
  int t = 1;
  if (argc > 1) t = atoi(argv[1]);
  for (int _t = (1); _t < int(t + 1); _t++) {
    int ret = solve(_t);
    if (ret == -1) break;
  }
  return 0;
}
