同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22844_PhoneNumber

2022-5-16 18:23| 发布者: Hocassian| 查看: 39| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-8950712621800-Problem List-采集的数据-后羿采集器.html

Pro.ID

22844

Title

Phone Number

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22844

AC

Submit

Ratio

61.76%

时间&空间限制

Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

描述

We know that if a phone number A is another phone number B's prefix, B is not able to be called. For an example, A is 123 while B is 12345, after pressing 123, we call A, and not able to call B.

Given N phone numbers, your task is to find whether there exits two numbers A and B that A is B's prefix.

输入

The input consists of several test cases.

The first line of input in each test case contains one integer N ( 0 < N < 1001 ), represent the number of phone numbers.

The next line contains N integers, describing the phone numbers.

The last case isfollowed by a line containing one zero.

输出

Description

We know that if a phone number A is another phone number B's prefix, B is not able to be called. For an example, A is 123 while B is 12345, after pressing 123, we call A, and not able to call B.

Given N phone numbers, your task is to find whether there exits two numbers A and B that A is B's prefix.

Input

The input consists of several test cases.

The first line of input in each test case contains one integer N ( 0 < N < 1001 ), represent the number of phone numbers.

The next line contains N integers, describing the phone numbers.

The last case isfollowed by a line containing one zero.

Output

For each test case, if there exits a phone number that cannot be called, print "NO", otherwise print "YES" instead.

Sample Input

2
012
012345
2
12
012345
0

Sample Output

NO
YES