Codeforces Round #357 (Div. 2) A

A. A Good Contest

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Codeforces user' handle color depends on his rating — it is red if his rating is greater or equal to 2400; it is orange if his rating is less than 2400 but greater or equal to 2200, etc. Each time participant takes part in a rated contest, his rating is changed depending on his performance.

Anton wants the color of his handle to become red. He considers his performance in the rated contest to be good if he outscored some participant, whose handle was colored red before the contest and his rating has increased after it.

Anton has written a program that analyses contest results and determines whether he performed good or not. Are you able to do the same?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100) — the number of participants Anton has outscored in this contest .

The next n lines describe participants results: the i-th of them consists of a participant handle name_i and two integers before_i and after_i ( - 4000 ≤ before_i, after_i ≤ 4000) — participant's rating before and after the contest, respectively. Each handle is a non-empty string, consisting of no more than 10 characters, which might be lowercase and uppercase English letters, digits, characters «_» and «-» characters.

It is guaranteed that all handles are distinct.

Output

Print «YES» (quotes for clarity), if Anton has performed good in the contest and «NO» (quotes for clarity) otherwise.

Examples

Input

3
Burunduk1 2526 2537
BudAlNik 2084 2214
subscriber 2833 2749

Output

YES

Input

3
Applejack 2400 2400
Fluttershy 2390 2431
Pinkie_Pie -2500 -2450

Output

NO

Note

In the first sample, Anton has outscored user with handle Burunduk1, whose handle was colored red before the contest and his rating has increased after the contest.

In the second sample, Applejack's rating has not increased after the contest, while both Fluttershy's and Pinkie_Pie's handles were not colored red before the contest.

题意：存在红名（rate>=2400的）并且涨分的输出YES 否则输出NO

题解：水题

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<algorithm>
 int n;
 char a[];
 int be,af;
 int  main()
 {
     scanf("%d",&n);
     int flag=;
     getchar();
     for(int i=;i<=n;i++)
     {
         scanf("%s %d %d",a,&be,&af);
         if(be>=&&af>be)
         flag=;
     }
     if(flag)
     printf("YES\n");
     else
     printf("NO\n");
     return ;
  }