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 (Python):
N=int(input())
A=list(map(int,input().split()))
if len(A)==len(set(A)):
    print('YES')
else:
    print('NO')

Solution (Python):
import itertools
import math
import fractions
import functools
n = int(input())
a = list(map(int, input().split()))

s = set(a)
if len(s) == len(a):
    print("YES")
else: print("NO")

Solution (Python):
n = int(input())
a = set(map(int, input().split()))
print('YES' if len(a) == n else 'NO')

Solution (Python):

import sys

sysread = sys.stdin.readline
read = sys.stdin.read


sys.setrecursionlimit(10**7)




def run():
    N = int(input())
    A = list(map(int, sysread().split()))
    A = sorted(A)
    for i in range(N-1):
        if A[i] == A[i+1]:
            print('NO')
            return None
    print('YES')


if __name__ == "__main__":
    run()

Solution (Python):
n = int(input())
a_list = list(map(int, input().split()))
if len(a_list) == len(set(a_list)):
    print('YES')
else:
    print('NO')

Solution (Python):
n = int(input())
a = set( map(int,input().split()) )
if len(a)==n :
    print('YES')
else :
    print('NO')

Solution (Python):
n = input()
a = input().split()
b = [int(i) for i in a]
 
b.sort()

for i in range(0,int(n)-1):
  if(b[i] == b[i+1]):
    print("NO")
    exit()
print("YES")

Solution (Python):
n = int(input())
a = list(map(int,input().split()))

if len(a) == len(set(a)):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
s = set(a)
if len(s) == n:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

A.sort()
count = 0

for i in range(1, N):
    if A[i-1] == A[i]:
        count += 1
        break

if count == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
s = set(a)
if len(s) == n:
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
if n == len(set(a)):
    print('YES')
else:
    print('NO')

Solution (Python):
N = int(input())
num_list = list(map(int, input().split()))
num_list = sorted(num_list)

for i in range(len(num_list)):
  if i == N-1:
    print('YES')
  elif num_list[i] == num_list[i+1]:
    print('NO')
    exit()

Solution (Python):

"""
Created on Fri May  8 14:22:50 2020

@author: shinba
"""
from collections import Counter

n = int(input())
X = list(map(int,input().split()))

ans = Counter(X)

if len(ans) == n:
    print("YES")
else:
    print("NO")

Solution (Python):
from collections import Counter


N = int(input())
A = list(map(int, input().split()))

if [1] * N == list(Counter(A).values()):
    print("YES")
else:
    print("NO")

Solution (Python):
S=int(input())
T = input().split()
U = [int(i) for i in T]
U.sort()
r = 0

for i in range(S-1):
  if(U[i] == U[i+1]):
    r+=1
    
if(r==0):
  print("YES")
else:
  print("NO")

Solution (Python):
import sys
n = int(input())
A = list(map(int, input().split()))

A.sort()

previous = 0
for a in A:
    if a == previous:
        print("NO")
        sys.exit(0)
    previous = a
print("YES")

Solution (Python):
n = int(input())
a = input().split()
if n == len(set(a)):
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
A = list(map(int, input().split()))

if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
a_list = list(map(int,input().split(" ")))
a_set = set(a_list)
if len(a_list) == len(a_set):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a_ = list(map(int,input().split()))

import collections
cnt = list(collections.Counter(a_))

print('YES' if len(cnt) == n else 'NO')

Solution (Python):
def solve():
    N = int(input())
    A = set(input().split())
    
    a = len(A)
    if a == N:
        print("YES")
    elif a != N:
        print("NO")


if __name__ == '__main__':
    solve()

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
if len(a)==len(set(a)):
  print('YES')
else:
  print('NO')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

if (len(A) != len(set(A))):
  print('NO')
else:
  print('YES')

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
if len(a)==len(set(a)):
  print('YES')
else:
  print('NO')

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
A = set(a)

if len(A)==len(a):
    print("YES")
else:
    print("NO")

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    n = int(stdin.readline())
    a = list(map(int, stdin.readline().split()))

    if n == len(set(a)):
        print('YES')
    else:
        print('NO')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
from collections import Counter as ct
n = int(input())
a = ct(list(map(int, input().split())))

for i in a.values():
    if i >= 2:
        print("NO")
        exit()
print("YES")

Solution (Python):
import sys
input = sys.stdin.readline

n = int(input())
a = list(map(int, input().split()))

cur = set(a)
if len(cur) == len(a):
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = [int(a) for a in input().split()]
B = set(A)

if len(A)==len(B):
  print("YES")
else:
  print("NO")

Solution (Python):
from collections import Counter
N=int(input())
A=list(map(int,input().split()))

c = Counter(A).most_common()

for i in range(len(c)):
  if c[i][1]>1:
    print("NO")
    exit()

print("YES")

Solution (Python):
Num = int(input())
num_list =list(map(int,input().split()))
set_list = list(set(num_list))
if len(num_list)-len(set_list) > 0:
    print("NO")
else:
    print("YES")

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
a.sort()

fl = True

for i in range(1,n):
    if a[i-1] == a[i]:
        fl = False

if fl:
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]

print("YES" if len(set(A)) == N else "NO")

Solution (Python):
N=int(input())
A= list(map(int,input().split()))
dic={}
b=0
for i in A:
 if i in dic:
  b+=1
 else:
  dic[i]=1 
if b==0:
 print("YES")
else:
 print("NO")

Solution (Python):
N = int(input())
S = map(int, input().split())
if len(set(S)) == N:
  print('YES')
else:
  print('NO')

Solution (Python):
N = int(input())
list1 = sorted(list(map(int, input().split())))

s = 'YES'
for i in range(N-1):
  if list1[i] == list1[i+1]:
    s = 'NO'
    break
print(s)

Solution (Python):
N = int(input())
list1 = sorted(list(map(int, input().split())))
pre_num = None
s = 'YES'
for num in list1:
  if num == pre_num:
    s = 'NO'
    break
  pre_num = num
print(s)

Solution (Python):
import collections
import sys
N = int(input())
A = list(map(int, input().split()))

a_dict = collections.Counter(A)
for v in a_dict.values():
    if v >= 2:
        print("NO")
        sys.exit(0)
        
else:
    print("YES")

Solution (Python):


N = int(input())
A = [int(a) for a in input().split()]
B = set(A)
print('YES' if len(A) == len(B) else 'NO')

Solution (Python):
N = int(input())
A = set(list(map(int,input().split())))

if len(A)==N:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys

readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))


n = readint()
a = readints()

print('YES'if len(set(a))==len(a)else'NO')

Solution (Python):
n=int(input())
a=list(map(int, input().split()))
s=set(a)
if len(s) == len(a):
    print("YES")
else:
    print("NO")

Solution (Python):


N = int(input())
A = [int(a) for a in input().split()]
B = set(A)
print('YES' if len(A) == len(B) else 'NO')

Solution (Python):
n = int(input())
a_list = list(map(int, input().split()))
a_hash = {}
for a in a_list:
    if a in a_hash:
        print("NO")
        exit()
    a_hash[a] = True
print("YES")

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
if len(a) == len(set(a)):
    print('YES')
else:
    print('NO')

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

n = I()
A = LI()
if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
s = list(map(int, input().split()))
print('YES' if len(set(s)) == len(s) else 'NO')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A.sort()

yesno = 'YES'
for i in range(len(A)-1):
    if A[i]==A[i+1]:
        yesno = 'NO'
        break
print(yesno)

Solution (Python):
n = int(input())
a = list(map(int , input().split()))
 
import collections
dic = collections.Counter(a)
 
if max(dic.values()) == 1:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int , input().split()))

set_a = set(a)

if len(set_a) == len(a):
    print("YES")
else:
    print("NO")

Solution (Python):


N = int(input().strip())
A_list = list(map(int, input().rstrip().split()))


A_set = set()

for a in A_list:
    if a in A_set:
        print("NO")
        break
    
    A_set.add(a)
    
else:
    print("YES")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

sa = set(a)
if len(sa) == n:
    print('YES')
else:
    print('NO')

Solution (Python):
n=int(input())
a=list(map(int,input().split()))

if len(a)==len(set(a)):
    print('YES')
    
else:
    print('NO')

Solution (Python):

n = int(input())
x = list(map(int, input().split()))
nx = sorted(x)
y = False

for i in range(n):
    if nx[i] == nx[i-1]:
        y = True
        break
    else:
        continue

print("YES") if y == False else print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
set_a = set(a)
if len(set_a) == n:
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A.sort()

for i in range(N-1):
  if A[i] == A[i+1]:
    print('NO')
    exit()
  else:
    pass
print('YES')

Solution (Python):
import sys

n = int(input())
As = list(map(int, input().split()))
sort_as = sorted(As)
for i in range(len(sort_as)):
    if i == len(sort_as)-1:
        pass
    else:
        if sort_as[i+1] == sort_as[i]:
            print("NO")
            sys.exit()
        else:
            continue

print("YES")

Solution (Python):
N = int(input())
A = [int(_) for _ in input().split()]
if N == len(set(A)):
    print('YES')
else:
    print('NO')

Solution (Python):


N = int(input())
A = [i for i in input().split(" ")]
if len(A)==len(set(A)):
    print('YES')
else:
    print('NO')

Solution (Python):
import numpy as np
from collections import defaultdict

n = int(input())
a = np.array(list(map(int, input().split())))

d = defaultdict(int)

for i in range(n):
    d[a[i]] += 1

print("YES") if max(d.values()) == 1 else print("NO")

Solution (Python):
n = int(input())
a_list = list(map(int, input().split()))

a_set = list(set(a_list))
if len(a_list) == len(a_set):
    print('YES')
else:
    print('NO')

Solution (Python):
N = int(input())
A = [int(i) for i in input().split()]

ans = "YES" if len(set(A))==N else "NO"
print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

aa = set(a)

if len(a) == len(aa) :
    print('YES')
else :
    print('NO')

Solution (Python):
import sys
N = int(input())
A_list = list(map(int,input().split()))
A_list.sort()

for i in range(N-1):
  if A_list[i] == A_list[i+1]:
    print('NO')
    sys.exit()
print('YES')

Solution (Python):
n = int(input())
xs = set(map(int,input().split()))

if len(xs) == n:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

n_map = {}
ok = True
for a in A:
    if str(a) in n_map:
        ok = False
    n_map[str(a)] = True
if ok:
    print("YES")
else:
    print("NO")

Solution (Python):
def main():
    N = int(input())
    A = list(map(int, input().split(' ')))
    print('YES' if len(set(A)) == N else 'NO')


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = set(map(int, input().split(" ")))

if n == len(s):
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
seta = set(a)
if len(a)==len(seta):
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
if len(A) == len(list(set(A))):
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
set_1 = set()
list_1 = list(map(int, input().split(' ')))

for item in list_1:
  set_1.add(item)

if len(list_1) == len(set_1):
  print("YES", end="")
else:
  print("NO", end="")

Solution (Python):
n = int(input())
s = list(map(int,input().split()))
 
def count(x):
    if len(s) != len(set(x)):
        return "NO"
    else:
        return "YES"
print(count(s))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
if len(set(A)) == len(A):
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

lenA = len(A)
lenB = len(set(A))

if lenA != lenB:
    print("NO")
else:
    print("YES")

Solution (Python):
N = int(input())
A = tuple(map(int, input().split()))

s = set()
ok = True
for a in A:
    if a in s:
        ok = False
        break
    else:
        s.add(a)

if ok:
    print('YES')
else:
    print('NO')

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=set(a)
if len(a)==len(b):
  print("YES")
else:
  print("NO")

Solution (Python):
N = input()
A = list(map(int, input().split()))
if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

cond = len(set(a)) == len(a)

if cond:
    print("YES")
else:
    print("NO")

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
A.sort()
for i in range(N-1):
    if A[i+1]-A[i]==0:
        print("NO")
        exit(0)
print("YES")

Solution (Python):
def solve():
    N = int(input())
    A = set(map(int, input().split()))
    return "YES" if N == len(A) else "NO"

print(solve())

Solution (Python):
n = int(input())
a = {int(i) for i in input().split()}
if n == len(a) :
    print("YES")
else :
    print("NO")

Solution (Python):
n = int(input())
a = [int(x) for x in input().split()]
if(n > len(set(a))):	print('NO')
else:	print('YES')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

print("NO") if len(set(A)) != len(A) else print("YES")

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
A.sort()

ans = 'YES'
old = A[0]
for i in range(1,N):
    x = A[i]
    if x == old:
        ans = 'NO'
        break
    old = x

print(ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
    if a[i] == a[i+1]:
        print('NO')
        exit()
print('YES')

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
A.sort()
p = 0
for i in range(N-1):
    if A[i] == A[i+1]:
        p = 1
        break
if p == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
A=set(a)
if n==len(A):
    print("YES")
else:
    print("NO")

Solution (Python):



"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""

n = int(input())
li = input().split()
l = list(set(li))


if len(l)==len(li):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
print(['NO','YES'][len(set(list(map(int, input().split()))))==n])

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
d={}
flag=0

for i in range(n):
  if l[i] in d:
    flag=1
    break
  else:
    d[l[i]]=1
    
if flag==0:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
A = list(input().split())

if len(set(A)) == N:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = len(a)
a = set(a)
c = len(a)
if (b==c):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = [int(x) for x in input().split()]
s_a = sorted(a)
if len(s_a) == len(set(s_a)):
    print('YES')
else:
    print('NO')

Solution (Python):
input()

a=list(map(int, input().split())) 

A=set(a)
if len(A)!=len(a):
    print("NO")
else :
    print("YES")

Solution (Python):
from collections import defaultdict

N = int(input())
A = list(map(int, input().split()))

d = defaultdict(int)
for a in A:
    d[a] += 1

if len(d) == N:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
print(['NO','YES'][len(set(a))==n])

Solution (Python):
import numpy as np

N = int(input())
a = list(map(int, input().split()))
b = []
flag = []

b = sorted(a)

for i in range(0,N-1):
  if (b[i+1]-b[i]) == 0:
    flag.append(0)
  else:
    flag.append(1)

if np.prod(flag) == 0:
  print ("NO")
else:
  print ("YES")

Solution (Python):
n=int(input())
a=list(map(int,input().split()))

if len(a) == len(set(a)):
    print('YES')
else:
    print('NO')

Solution (Python):
n=input();a=list(map(int,input().split()))
print(["YES","NO"][len(set(a))!=len(a)])

Solution (Python):
n = int(input())
num = list(map(int, input().split()))
if len(num) == len(set(num)):
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
num = list(map(int, input().split()))
lenbef = len(num)
numset = set(num)
lenaft = len(numset)

if lenbef == lenaft:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
A = [int(k) for k in input().split()]

result = True










A.sort()

for i in range(N-1):
    if (A[i] == A[i+1]):
        result = False
        break

if (result == True):
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

A.sort()

flag = True
for i in range(len(A) - 1):
    if A[i] == A[i + 1]:
        flag = False
        break
    
if flag:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
b = list(set(a))
if len(a)==len(b):
    print('YES')
else:
    print('NO')

Solution (Python):
def main():
    N = int(input())  
    A = list(map(int, input().split()))  

    d = {}

    for i in A:
        if not i in d.keys():
            d[i] = None
        else:
            print("NO")
            return
    else:
        print("YES")


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
s=list(map(int,input().split()))
d=list(set(s))
if len(s)==len(d):
  print("YES")
else:
  print("NO")

Solution (Python):
n, *a = map(int, open(0).read().split())
b = set(a)
if len(a)==len(b):
  print('YES')
else:
  print('NO')

Solution (Python):
def solve():
    N = int(input())
    A = set(map(int,input().split()))
    if N == len(A):
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    solve()

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
print("YES") if len(A) == len(list(set(A))) else print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
be_len = len(A)
A = list(set(A))
if len(A) == be_len:
    print("YES")
else:
    print("NO")

Solution (Python):
n=int(input())
l=[int(i) for i in input().split()]
if len(set(l))==n:
    print("YES")
else:
    print("NO")

Solution (Python):

from collections import Counter
n = int(input())
a = list(map(int, input().split()))
a = Counter(a)
f = 0
for i in a.most_common():
    if i[1] != 1:
        print("NO")
        f = 1
        break
if f == 0:
    print("YES")

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
if len(A) != len(set(A)):
    print("NO")
else:
    print("YES")

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
s=set(a)
if len(s)==n:
  print("YES")
else:
  print("NO")

Solution (Python):
n=int(input())
a=list(map(int, input().split()))

a.sort()

for i in range(n-1):
    if a[i]==a[i+1]:
        print("NO")
        exit()

print("YES")

Solution (Python):
N = int(input())
A = sorted([int(i) for i in input().split()])

match = False
for i in range(1, N):
    if A[i] == A[i-1]:
        match = True
        break

if not match:
    print("YES")
else:
    print("NO")

Solution (Python):
int_row_num = int(input())
base_list = input().split()
if len(base_list) != len(set(base_list)):
  print('NO')
else:
  print('YES')

Solution (Python):
n = int(input())
l = list(input().split())
print ("YES") if len(l) == len(set(l)) else print ("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

if len(list(set(a)))==n:
    print('YES')
else:
    print('NO')

Solution (Python):
N=int(input())
A=set(int(i) for i in input().split())
print('YES' if len(A)==N else 'NO')

Solution (Python):
N = int(input())
A= list(map(int,input().split()))
A.sort()
flag = 0
for i in range(N-1):
    if A[i] == A[i+1]:
        flag = 1
        break
    else:
        continue

if flag ==1:
    print("NO")
else:
    print("YES")

Solution (Python):
n,*a=map(int,open(0).read().split())
if len(set(a))==len(a):
  print('YES')
else:
  print('NO')

Solution (Python):
n=input()
l=list(map(int,input().split()))
if len(l)==len(set(l)):
    print("YES")
else:print("NO")

Solution (Python):
N=int(input())
A=[int(x) for x in input().rstrip().split()]
A=list(set(A))

if N==len(A):
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = set(a)
if len(a) == len(b):
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
A = [int(a) for a in input().split()]
B = list(set(A))
if len(A) == len(B):
  print('YES')
else:
  print('NO')

Solution (Python):
n=int(input())
arr=[int(x) for x in input().split()]
l=set(arr)
l=list(l)
l.sort()
arr.sort()
if arr==l:
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
s = input().split()
a = sorted(s)
t = 0
d = 0
for c in a:
  if c == t:
    d += 1
    break
  t = c
if d == 1:
  print('NO')
else:
  print('YES')

Solution (Python):
from collections import Counter

N=int(input())
int_s = list(map(int,input().split()))

c=Counter(int_s)

product =1
for i in list(c.values()):
    product*=i

if product==1:
    print('YES')
else:
    print('NO')

Solution (Python):
n=int(input())
a=set(map(int,input().split()))
b=len(a)
if n==b:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
if len(set(A)) == len(A):
    print("YES")
else:
    print("NO")

Solution (Python):
import sys
n = int(sys.stdin.readline())
li = list(map(int, sys.stdin.readline().split()))
if len(li) != len(set(li)):
  print('NO')
else:
  print('YES')

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
A.sort()
for i in range(1, len(A)):
    if A[i - 1] != A[i]:
        k = True
    else:
        k = False
        break

if k:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
s = set(l)
if len(l)!=len(s):
  print('NO')
else:
  print('YES')

Solution (Python):
import sys

n = int(input())
a = list(map(int,input().split()))

d = {}

for i in range(n):
  if a[i] not in d.keys():
    d[a[i]] = 1
  else:
    print('NO')
    sys.exit()

print('YES')

Solution (Python):
n = int(input())

an = map(int,input().split())

if len(set(an)) == n:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())

set_nums = set(list(map(int, input().split())))

print('YES') if len(set_nums) == N else print('NO')

Solution (Python):
n = int(input())

an = map(int, input().split())

if len(set(an)) == n :
    print("YES")
else :
    print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
if N == len(set(A)):
  print('YES')
else:
  print('NO')

Solution (Python):
from collections import Counter
n = int(input())
a = list(map(int,input().split()))
acount = Counter(a)
if n == (len(list(acount.keys()))):
         print("YES")
else:
         print("NO")

Solution (Python):
import collections

n = int(input())
a = list(map(int,input().split()))
a.sort()

for i in range(n-1):
    if a[i] == a[i+1]:
        print("NO")
        exit()

print("YES")

Solution (Python):
import collections
N=int(input())
A=input().split()
c = collections.Counter(A)
if N==len(c):
    print('YES')
else:
    print('NO')

Solution (Python):
import collections
N = int(input())
A = list(map(int,input().split()))

K = collections.Counter(A)
B = len(K)

if N == len(K):
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
a = list(input().split())

a.sort()

for i in range(n-1):
    if a[i] == a[i+1]:
        print("NO")
        break
    if i == n-2:
        print("YES")

Solution (Python):
def resolve():
    n=int(input())
    l=list(map(int, input().split()))
    ans='YES'
    l.sort()
    for i in range(n-1):
        if l[i]==l[i+1]:
            ans='NO'
    print(ans)

resolve()

Solution (Python):


n=int(input())
a=list(map(int,input().split()))
a.sort()

for i in range(n-1):
    if a[i]==a[i+1]:
        print("NO")
        exit()

print("YES")

Solution (Python):
N = int(input())
A = [int(i) for i in input().split()]
print('YES' if len(set(A)) == N else 'NO')

Solution (Python):
N = int(input())
alist = list(map(int,input().split()))
alist.sort()
p = 1
for i in range(N-1):
    if alist[i] == alist[i+1]:
        p = p*0
        print('NO')
        break
if p == 1:
    print('YES')

Solution (Python):
n = int(input())
num = input().split()

if len(set(num)) == n:
  print("YES")
else:
  print("NO")

Solution (Python):
import collections
a=int(input())
b=list(map(str,input().split()))
n=[]
for i in b:
    x=i.replace(' ',',')
    n.append(x)
c=collections.Counter(n)
n,values=zip(*c.most_common())
d=list(values)

if d.count(1)==a:
    print('YES')
else:
    print('NO')

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
flg=0
if len(set(A))==N:
    flg=1
print("YES" if flg else "NO")

Solution (Python):
import sys
N = int(input())
A = input().split()
if N > len(set(A)):
    print('NO')
    sys.exit()
print('YES')

Solution (Python):
import sys
 
 
def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    a = list(map(int, readline().split()))
    a.sort()
    for i in range(1, n):
        if a[i] == a[i-1]:
            print("NO")
            exit()
    print("YES")
 
 
if __name__ == '__main__':
    solve()

Solution (Python):
import collections
import sys
N = input()
A = input().split()
A1 = map(int,collections.Counter(A).values())
for i in A1:
    if i >= 2:
        print('NO')
        sys.exit()
print('YES')

Solution (Python):
N = int(input())
lis = list(map(int,input().split()))
lis.sort()
judge = 0
for i in range(1,N):
    if lis[i-1] == lis[i]:
        judge = 1
if judge == 0:
    print("YES")
else:
    print("NO")

Solution (Python):


N = int(input())
A = list(map(int, input().split()))

A_set = len(set(A))
if N == A_set:
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))

if N == len(set(L)):
  print('YES')
else:
  print('NO')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
if len(set(A)) == N:
    print('YES')
else:
    print('NO')

Solution (Python):
import sys
n = int(input())
A = list(map(int,input().split()))
A.sort()
for i in range(n-1):
	if A[i]==A[i+1]:
		print("NO")
		sys.exit()
print("YES")

Solution (Python):
n = int(input())


a = set(input().split())
print('YES' if len(a) == n else 'NO')

Solution (Python):
import collections

n = int(input())
a = list(map(int, input().split()))


s = collections.Counter(a)


max_s = max(s.values())

if max_s == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
d = dict()
for i in range(n):
    d.setdefault(a[i])
if len(d) != n :
    print("NO")
else:
    print("YES")

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
	if a[i]==a[i+1]:
		print("NO")
		break
else:
	print("YES")

Solution (Python):
n = int(input())
a = set(input().split())
print('YES' if len(a) == n else 'NO')

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]
print('YES') if len(a) == len(set(a)) else print('NO')

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

set_a = set(a)
print("YES" if len(set_a) == len(a) else "NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
sorta = sorted(a)
sflag = False
for i in range(n - 1):
  if sorta[i] == sorta[i + 1]:
    sflag = True
    break
if sflag == True:
  print('NO')
else:
  print('YES')

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    A = il()
    print('YES' if len(set(A)) == N else 'NO')


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

if(len(set(A)) == N):
  print('YES')
else:
  print('NO')

Solution (Python):
import collections
n = int(input())
ls = list(map(int,input().split()))
if len(ls) == len(collections.Counter(ls)):
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A_list = list(map(int,input().split()))
A_set = set(A_list)

if len(A_list) == len(A_set):
    print("YES")
else:
    print("NO")