#include <bits/stdc++.h>
using namespace std;
long long binpow(long long a, long long b) {
  long long exp = 10e9;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = ((res % exp) * (a % exp)) % exp;
    a = ((a % exp) * (a % exp)) % exp;
    b >>= 1;
  }
  return res;
}
bool isprime(int x) {
  for (int d = 2; d * d <= x; d++) {
    if (x % d == 0) return false;
  }
  return true;
}
unsigned int cntsb(unsigned int n) {
  unsigned int count = 0;
  while (n) {
    count += n & 1;
    n >>= 1;
  }
  return count;
}
int bin2dec(string n) {
  string num = n;
  int dec_value = 0;
  int base = 1;
  int len = num.length();
  for (int i = len - 1; i >= 0; i--) {
    if (num[i] == '1') dec_value += base;
    base = base * 2;
  }
  return dec_value;
}
void solve() {}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int flag = 0;
  while (n--) {
    string s;
    cin >> s;
    signed int bef, aft;
    cin >> bef >> aft;
    if (bef >= 2400 && aft > bef) {
      flag++;
    }
  }
  if (flag)
    cout << "YES";
  else
    cout << "NO";
}
