Repeated Value

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

You are given an array $a$ of $n$ integers in $[0,1000]$.

Determine whether there exist two distinct indices $i\ne j$ such that $a_i=a_j$.

Input

• The first line contains $n$.
• The second line contains $a_1,a_2,\ldots,a_n$.

Output

Print YES if some value occurs at least twice; otherwise print NO.

Subtasks

Subtask 1 (20 points): $1\le n\le 50$ and $0\le a_i\le 100$.

Subtask 2 (30 points): $1\le n\le 5000$ and $0\le a_i\le 500$.

Subtask 3 (50 points): $1\le n\le 100000$ and $0\le a_i\le 1000$.

Example

Input

6
3 8 1 8 5 9

Output

YES

Explanation

The value 8 occurs twice, so the answer is YES.