Problem:
Score : 300 points

Problem Statement

Given is a sequence of integers A_1, A_2, ..., A_N.
If its elements are pairwise distinct, print YES; otherwise, print NO.

Constraints

2 ≤ N ≤ 200000

1 ≤ A_i ≤ 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

If the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.

Sample Input 1

5
2 6 1 4 5

Sample Output 1

YES

The elements are pairwise distinct.

Sample Input 2

6
4 1 3 1 6 2

Sample Output 2

NO

The second and fourth elements are identical.

Sample Input 3

2
10000000 10000000

Sample Output 3

NO

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

def swap(len,t, l)
    tmp[0] = len[t]
    len[t] = len[l]
    len[l] = tmp[0]
    return len
end

n = gets.to_i
data = gets.split(' ').map(&:to_i)

flag = 0;

data.length.times do |i|
    (data.length-(i+1)).times do |j|
        if data[j] == data[j+1] then
            flag = 1;
        elsif data[j] > data[j+1] then
            swap(data,j,j+1)
        end
        if flag == 1 then break end
    end
    if flag == 1 then break end
end

if flag == 1 then
    puts("NO")
else 
    puts("YES")
end