11591159 SUSTech Online Judge
Problem 1159 --a lanran problem

1159: a lanran problem

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 450  Solved: 272
[Submit][Status][Web Board]

Description

One day lanran finds that his name can be found in both string “lanran2001” and “20lanran01”. Now lanran gives you T(T<=1000) strings (string.length() <= 100). For each string, you can remove any substring of them to make it become the string “lanran”. If you can do this, print a “YES” in a line, otherwise print “NO”. 

Input

The first line will be an integer T(T<=1000), which is the number of given string.
For each test data, there will be one line containing a string of lowercase characters(‘a’ – ‘z’) and 0-9 digits. 

Output

For each given string, print the answer of lanran’s question.

Sample Input

6
lanran
lanran2001
20lan0r1an
lanan
nanla
larann

Sample Output

YES
YES
YES
NO
NO
NO

HINT

Source

stack_and_queue 

[Submit][Status]