peterverebics/CodeNet_Python_118 huggingface dataset:
n = int(input())
abc = list(map(int, input().split()))
ans = 'YES'
abc = sorted(abc)
for i in range(n-1):
  if abc[i] == abc[i+1]:
  	ans ='NO'

print(ans)
n = int(input())
lis = list(map(int, input().split()))
dic = {}
for i in lis:
    dic[i] = dic.get(i, 0) + 1
for j in dic.values():
    if j != 1:
        print('NO')
        break
else:
    print('YES')
N = int(input())
A_List = list(map(int,input().split()))

print("YES" if len(A_List)==len(set(A_List)) else "NO")
def distinct(a):
  d = {}
  for num in a:
    try: d[num] += 1
    except KeyError: d[num] = 1
  for key in d:
    if d[key] > 1: return False
  return True
n = int(input())
a = list(map(int, input().split()))
print('YES' if distinct(a) else 'NO')
N = int(input())
A = list(map(int, input().split()))

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

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

a = set(A)

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

if(len(c) != len(set(c))):
    print("NO")
else:
    print("YES")
n = int(input())
A = list(map(int,input().split()))
import collections
co = collections.Counter(A)
for num,c in co.items():
    if c >1:
        print("NO")
        break
else:
    print("YES")
N = int(input())
A = list(map(int,input().split()))

A.sort()

for i in range(1,N):
    if A[i]==A[i-1]:
        print("NO")
        exit()
print("YES")
n = int(input())
a = list(map(int, input().split()))
b = set(a)
if len(a) == len(b):
    print("YES")
else:
    print("NO")
N = int(input())
A = set(map(int,input().split()))
if len(A)==N:
    print("YES")
else:
    print("NO")
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))
if len(np.unique(a)) == len(a):
  print('YES')
else:
  print('NO')
n = int(input())
a = map(int, input().split())

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

la = set(a)

if(len(la)==len(a)):
    print("YES")
else:
    print("NO")
n = int(input())
l = list(map(int, input().split()))
x=len(l)
s=set(l)
y=len(s)
if x==y:
    print("YES")
else:
    print("NO")
n=int(input())
b=input().split()

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

dic = {}

for i in a:
    if i not in dic.keys():
        dic[i] = 1
    else:
        print("NO")
        exit()
print("YES")
#!/usr/bin/env python3
n, *a = map(int, open(0).read().split())
if len(a) == len(set(a)):
    print('YES')
else:
    print('NO')
N = int(input())
A = input().split(" ")
l1 = len(A)
Ax = set(A)
l2 = len(Ax)

if l1 == l2:
    print("YES")
else:
    print("NO")
n = int(input())
a = input().split()
# 同じものを除外
b = set(a)
if len(a) == len(b):
    print("YES")
else:
    print("NO")
n = int(input())
a = list(map(int, input().split()))
a.sort()
pd = True
for i in range(n-1):
  if a[i] == a[i+1]:
    pd = False
if pd: print('YES')
else: print('NO')
n=int(input())
a=list(map(int,input().split()))
s=set(a)
if len(s)==n:
  print("YES")
else:
  print("NO")
A=input()
B=list(map(int,input().split()))
B.sort()
num=0
for i in range(len(B)-1):
  if B[i]==B[i+1]:
    num=1
if num==1:
  print('NO')
else:
  print('YES')
a=set()
n=int(input())
x=list(map(int,input().split()))
for num in x:
  a.add(num)
if len(a) == n:
  print('YES')
else:
  print('NO')
n = int(input())
A = list(map(int, input().split()))

if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")
import sys
input = lambda: sys.stdin.readline().rstrip()
n=int(input()) 
a=[int(i) for i in input().split()]
a.sort()
for i in range(len(a)-1):
    if a[i]==a[i+1]:
        print('NO')
        exit(0)
print('YES')
print("YES" if int(input())==len(set(list(map(int,input().split()))))else"NO")
N = int(input())
A = list(map(int, input().split()))

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

A.sort()
flag=0
for i in range(1,n):
    if A[i] == A[i-1]:
        flag=1
if flag==1:
  print("NO")
else:
  print("YES")
import sys

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

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

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

A = sorted(A)

for i in range(N-1):
    if A[i] == A[i+1]:
        count += 1
            
if count == 0:
    print("YES")
    
else:
    print("NO")
N = int(input())
A = list(map(int,input().split()))
B = set(A)
if N == len(B):
  print("YES")
else:
  print("NO")
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n = int(input())
a = list(map(int, input().split()))
if len(a)==len(set(a)):
    print("YES")
else:
    print("NO")
n = int(input())
a =  list(map(int, input().split()))
if len(set(a)) == n:
  print('YES')
else:
  print('NO')
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = "YES"
for i in range(1,n):
  if(a[i-1]==a[i]):
    ans = "NO"
    break
print(ans)
n=int(input())
c=sorted(list(map(int, input().split())))
ans = 0

for i in range(n-1):
    if c[i] == c[i+1]:
        ans +=1

if ans == 0:
    print('YES')
if ans != 0:
    print('NO')
n = int(input())
a = list(map(int, input().split()))

h = {}
for i in a:
    if i in h:
        print('NO')
        exit(0)
    else:
        h[i] = 0
print('YES')
n = int(input())
a = set(list(int(i) for i in input().split()))
if n == len(a):
	print("YES")
else:
	print("NO")
N = int(input().rstrip())
X = list(map(int,input().split()))

X.sort()
res = 'YES'
for n in range(0,N-1) :
  if X[n] == X[n+1]:
    res = 'NO'
    break

print(res)
n = int(input())
a = [int(i) for i in input().split()]

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

print("YES")
n = int(input())
a = list(map(int, input().split()))
m = {}

distinct = True
for i in a:
    if i in m:
        distinct = False
        break
    m[i] = 1
    
if distinct:
    print("YES")
else:
    print('NO')
N = int(input())
A = [int(i) for i in input().split()]
print('YES' if len(set(A)) == N else 'NO')
n = int(input())
alst = list(map(int,input().split()))
aset = set(alst)
if len(alst) == len(aset):
  print("YES")
else:
  print("NO")
N=int(input())
a=list(map(int,input().split()))
if len(set(a))==N:
  print('YES')
else:
  print('NO')
n = int(input())
 
a = list(map(int,input().split()))
 
set_a = list(set(a))
 
if len(set_a) == n:
    print("YES")
else:
    print("NO")
n=int(input())
a=sorted(list(map(int,input().split())))
unt=False
for i in range(0,n-1):
    if a[i]==a[i+1]:
        unt=True
if unt:
    print('NO')
else:
    print('YES')
N = int(input())
A = set(list(map(int, input().split())))
if len(A) != N:
  print("NO")
else:
  print("YES")
N = int(input())
S = set(map(int,input().split()))
if len(S) == N:
    print("YES")
else:
    print("NO")
n=int(input())
s=list(map(int,input().split()))
s.sort()

cnt=0
for i in range(n-1):
    if s[i]==s[i+1]:
        print('NO')
        exit()
    else:
        cnt+=1
if cnt==n-1:            
    print('YES')
N = int(input())
A_ls = list(input().split(' '))
rst = { i for i in A_ls }
if len(rst) == N:
    print('YES')
else:
    print('NO')
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()
input()
A = list(map(int, input().split()))
B = set()
for a in A:
	B.add(a)
if len(A) == len(B):
	print('YES')
else:
	print('NO')
N = int(input())
A = list(map(int, input().split()))

h = {}
ans = 'YES'
for i in range(N):
    a = h.get(A[i], 0)
    if a != 0:
        ans = 'NO'
        break
    h[A[i]] = A[i]

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

def has_duplicates(seq):
    return len(seq) != len(set(seq))

print('NO' if has_duplicates(A) else 'YES')
s = input()
a = map(int, input().lower().split())

if int(s) == len(set(a)):
  print("YES")
else:
  print("NO")
N=int(input())
#b,c=int(input()),int(input())
# c=[]
#  for i in b:
#     c.append(i)
#e1,e2 = map(int,input().split())
A = list(map(int,input().split()))
#j = [input() for _ in range(a)]
# h = []
# for i in range(e1):
#     h.append(list(map(int,input().split())))
A.sort()
ans="YES"
for i in range(1,N):
    if A[i-1]==A[i]:
        ans="NO"
        break
print(ans)
def main():
    hoge = input()
    huga = list(map(int, input().split()))
    if len(huga) == len(set(huga)):
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()
N = int(input())
A = list(map(int,input().split()))
C = {}
for i in range(N):
    a = A[i]
    if a not in C:
        C[a] = 0
    C[a] += 1
flag = 0
for a in C:
    if C[a]>1:
        flag = 1
        break
if flag==0:
    print("YES")
else:
    print("NO")
N = int(input())
A = list(map(int,input().split(' ')))

is_break = False
seen = set()
for a in A:
    if a not in seen:
        seen.add(a)
    else:
        is_break=True
        break

if is_break:
    print('NO')
else:
    print('YES')
# coding: utf-8

import collections

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

if len(collections.Counter(a_list))==len(a_list):
    print("YES")
else:
    print("NO")
N = input()
A = list(map(int, input().split()))

print(['YES', 'NO'][len(A) != len(set(A))])
n=input()
nums=list(map(int, input().split()))
nums.sort()
res = True
prev = None
for i in nums:
    if i == prev:
        res = False
    else:
        prev = i
if res:
    print("YES")
else:
    print("NO")
n = int(input())
a = list(map(int, input().split()))
b = set(a)

print('YES' if len(a) == len(b) else 'NO')
import sys
input = sys.stdin.readline

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

from collections import Counter

c = Counter(A)

for i in c.values():
    if i != 1:
        print("NO")
        sys.exit()
print("YES")
N=int(input())
from collections import Counter
if max(Counter([int(x) for x in input().split()]).values())==1:
  print("YES")
else:
  print("NO")
n=int(input())
a=list(map(int,input().split()))
b=list(set(a))
if len(b)<len(a):
    print('NO')
else:
    print('YES')
N = int(input())
A = [int(x) for x in input().split()]

A_dict = {}
for i in A:
    if not i in A_dict:
        A_dict[i] = 1

if len(A_dict) == N:
    print('YES')
else:
    print('NO')
a = int(input())
l = list(map(int, input().split()))
s = set(l)
if len(l)==len(s):
  print("YES")
else:
  print("NO")
N=int(input())
print('YES' if N==len(set(map(int,input().split()))) else 'NO')
n = int(input())
a = [int(z) for z in input().split()]
st = set()
for i in a:
  if i in st:
    print("NO")
    exit(0)
  st.add(i)
print("YES")
N = int(input())
A = list(map(int,input().split()))
S = set(A)
if len(A) == len(S):
  print("YES")
else:
  print("NO")
def main():
    n = int(input())
    a = set(map(int, input().split(" ")))
    print("YES" if len(a) == n else "NO")

main()
n = int(input()) 
N = list(map(int,input().split()))
N.sort()
for i in range(0,n-1):
    if N[i] == N[i+1]:
        print('NO')
        break
else:
    print('YES')
n = int(input())
a = list(map(int, input().split()))
a.sort()
flag = False
for i in range(len(a)-1):
    if a[i] == a[i+1]:
        flag = True
        break
if flag:
    print("NO")
else:
    print("YES")
N = int(input())
As = list(map(int, input().split()))

if len(As) == len(set(As)):
    print('YES')
else:
    print('NO')
N = input()
A = input().split()
lists = list(A)
def has_duplicates(seq):
    return len(seq) != len(set(seq))
if str(has_duplicates(lists)) == "False":
     print("YES")
else:
    print("NO")
N = input()
a = input()

aa = a.split(' ')

def_len = len(aa)
cal_len = len(set(aa))

if(def_len == cal_len):
    print('YES')
else:
    print('NO')
import sys

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

As.sort()
for i in range(N):
    for j in range(i + 1, N):
        if As[i] == As[j]:
            print('NO')
            sys.exit(0)
        if As[j] > As[i]:
            break

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

s = set()

for ai in a:
    s.add(ai)

can = len(s) == n

print("YES" if can else "NO")
N = int(input())
A = list(map(int, input().split()))

if len(set(A)) == N:
    print("YES")
else:
    print("NO")
N = int(input())
A = set(list(map(int, input().split())))
if len(A) == N:
    print("YES")
else:
    print("NO")
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')
N = int(input())
A_set = set(list(map(int, input().split(' '))))
if len(A_set) == N:
    print('YES')
else:
    print('NO')
N = int(input())
A = input().split()
A.sort()
frag = None
for i in range(N-1):
  if A[i] ==A[i+1]:
    print('NO')
    frag = 1
    break
if frag == None:
  print('YES')
n = int(input())
arr = list(map(int, input().split()))
arr = set(arr)
print("YES" if len(arr) == n else "NO")
from collections import Counter

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

c = Counter(a)
if c.most_common()[0][1] == 1:
    print('YES')
else:
    print('NO')
import numpy as np

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

A_uni = np.unique(A)
if len(A_uni) < N:
    ans = 'NO'
else:
    ans = 'YES'
print(str(ans))
N = int(input())
As = list(map(int,input().split()))

if len(As) - len(set(As)) == 0:
    print('YES')
else:
    print('NO')
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 'YES'
for i in range(n-1):
    if a[i] == a[i+1]:
        ans = 'NO'    
print(ans)
n = int(input())
x = set(map(int, input().split()))
if len(x) == n:
    print('YES')
else:
    print('NO')
n = int(input())
a = list(map(int, input().split()))
a.sort()

tmp = a[0]
for i in range(1,n):
    if a[i] == tmp:
        print('NO')
        break
    else:
        tmp = a[i]
else:
    print('YES')
input()
li = list(map(int, input().split()))
print('NO' if len(li)>len(set(li)) else 'YES')
n = int(input())
a = list(map(int,input().split()))
A = set(a)
if len(A) == len(a):
    print('YES')
else:
    print('NO')
n = int(input())
a = list(map(int,input().split()))

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

    a.sort()

    for i in range(1,len(a)):

        if a[i] == a[i-1] :

            print('NO')
            return
    print('YES')
if __name__=='__main__':
    main()
n = int(input())
data = list(map(int, input().split()))

data.sort()

ans = "YES"
for i in range(len(data) - 1):
  if data[i] == data[i+1]:
    ans = "NO"
    break

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

for i in range(1, N):
    if A[i-1] == A[i]:
        print("NO")
        exit()
print("YES")
from collections import defaultdict
inpl = lambda: list(map(int,input().split()))
N = int(input())
A = inpl()
d = defaultdict(int)
for a in A:
    if d[a] == 0:
        d[a] = 1
    else:
        print('NO')
        exit()
print('YES')
n=int(input())
a=set(map(int,input().split()))
print("YES") if len(a)==n else print("NO")
#C

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

c = True
for i in range(n-1):
    
    if a[i] == a[i+1]:
        print("NO")
        c = False
        break
if c == True:
    print("YES")
N = int(input())
A = list(map(int,input().split()))

val = len(set(A))

if N == val:
  print("YES")
else:
  print("NO")
N = int(input())
M = input().split()

if N == len(set(M)):
    print("YES")
else:
    print("NO")
n=int(input())
a=sorted(input().split())
print('YES'if len(set(a))==n else 'NO')
n= int(input())
a = [int(i) for i in input().split()]
def has_duplicates(seq):
    return len(seq) != len(set(seq))
ans = has_duplicates(a)
if ans == True:
    print("NO")
else:
    print("YES")
from collections import Counter

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

cnt = Counter(A)

for i in cnt:
    if cnt[i] > 1:
        print("NO")
        exit()

print("YES")
n=int(input())
a=sorted(list(map(int,input().split())))

x=a[0]
for i in range(1,len(a)):
    if x==a[i]:
        print('NO')
        exit()
    else:
        x=a[i]
print("YES")
N = int(input())
A = list(map(int, input().split()))
if len(A) > len(set(A)):
  print("NO")
else:
  print("YES")
N = int(input())
A = list(map(int, input().split()))
res = "YES"
A.sort()
for i in range(len(A)):
    if i == 0:
        continue
    if A[i-1] == A[i]:
        res = "NO"
        break
    else:
        continue
print(res)
n = int(input())
list = list(map(int,input().split()))

ans = set(list)

if len(ans) == n:
    print('YES')
else:
    print('NO')
from collections import Counter

input()
print("YES" if not set(Counter(input().split()).values()) - {1} else "NO")
N = int(input())
As = [int(a) for a in input().split()]

a_uniq = set(As)

if len(a_uniq) == N:
    print("YES")
else:
    print("NO")
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
A = LIST()

se = list(set(A))

if len(A) == len(se):
	print("YES")
else:
	print("NO")
n = int(input())
a = list(map(int, input().split()))
sa = set(a)
print("YES") if len(a) == len(sa) else print("NO")
n = int(input())
a_list = list(map(int, input().split()))
a_set = set(a_list)
print("YES") if n == len(a_set) else print("NO")
N=int(input())
A=list(map(int,input().split()))
ans={}
flag=0

for i in A:
    if(ans.get(i)!=None):
        flag=1
        break
    else:
        ans[i]=1
        
if(flag==0):
    print("YES")
else:
    print("NO")
# C - Distinct or Not
def main():
    N, *A = map(int, open(0).read().split())
    print("YES" if len(set(A)) == N else "NO")


if __name__ == "__main__":
    main()
N = int(input())
A = list(map(int, input().split()))

exists = set()

for a in A:
    if a in exists:
        print('NO')
        break
    exists.add(a)
else:
    print('YES')
n =int(input())
a = list(map(int,input().split()))	
l = list()

l = sorted(a)
answer = max(x - y for x, y in zip(l, l[1:]))
if answer == 0:
    print('NO')
else:
    print('YES')
n = input()
a = input().split()
if len(a)== len(set(a)):
  print("YES")
else:
  print("NO")
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
    print("YES")
    
else:
    print("NO")
n=int(input())
if len(set(map(int,input().split())))==n:
  print('YES')
else:
  print('NO')
N = int(input())
A = list(map(int,input().split()))
A.sort()
ans = "YES"
for i in range(N-1):
    if A[i] == A[i+1]:
        ans = "NO"
print(ans)
#
import sys
import math
import numpy as np
import itertools


# ひとつ入力
n = int(input())
# 空白区切りの数列をリストに代入
t = [int(i) for i in input().split()] 

t.sort()

for i in range(1,n):
    if t[i]==t[i-1]:
        print("NO")
        exit()
print("YES")
n = int(input())
A = list(map(int,input().split()))
if (len(set(A))==len(A)):
  print('YES')
else:
  print('NO')
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
if(flag == 1):
  print("NO")
else:
  print("YES")
N = int(input())
A = set(list(map(int, input().split())))

if N == len(A):
    print("YES")
else:
    print("NO")
def has_duplicates(seq):
    return len(seq) == len(set(seq))


iranai  =input()
l   =   input()
aa  =   l.split(sep=" ")
if has_duplicates(aa):
    print("YES")
else:
    print("NO")
S = int(input())
A = list(map(int, input().split()))
A.sort()
flg=False
for i in range(S-1):
  if A[i]==A[i+1]:
    flg=True
    break
if flg==True:
  print('NO')
else:
  print('YES')
n = int(input())
a = set(map(int, input().split(" ")))
if len(a) == n:
    print("YES")
else:
    print("NO")
#!/usr/bin/env python3

def main():
    n = int(input())
    ai = list(map(int, input().split()))
    ais = set(ai)
    print("YES" if len(ais) == len(ai) else "NO")


main()
n = int(input())
a = input().split()
a_unique = list(set(a))

ans = "NO"
if len(a) == len(a_unique):
  ans = "YES"
print(ans)
# -*- coding: utf-8 -*-
"""
Created on Wed Mar  4 17:14:33 2020

@author: Kanaru Sato
"""

N = int(input())
A = input().split()

D = {}

for i in range(0,N):
    if A[i] not in D:
        D[A[i]] = 1
    elif A[i] in D:
        D[A[i]] += 1
        

flag = 0

for i in list(D.values()):
    if i > 1:
        flag = 1
        break
    elif i <= 1:
        continue

if flag==0:
    print("YES")
else:
    print("NO")
n = int(input())
lis = list(map(int,input().split()))
lis.sort()
for i in range(n-1):
  if lis[i] == lis[i+1]:
    print("NO")
    exit()
print("YES")
def duplication(seq):
    return len(seq) != len(set(seq))

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

if duplication(a) == True:
    print('NO')
else:
    print('YES')
n = int(input())
A = list(map(int,input().split()))
Aset = set(A)
if len(Aset) == n:
    print("YES")
else:
    print("NO")
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

from collections import Counter
def main():
    n = II()
    a_s = LI()
    if len(Counter(a_s)) == n:
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()
n = int(input())
lst = list(map(int, input().split()))
flag = 0
lst.sort()
for i in range(n-1):
  if lst[i] == lst[i+1]:
    print('NO')
    flag = 1
    break
if flag == 0:
  print('YES')
N = int(input())
A = list(map(int, input().split()))
if len(set(A)) == N:
  print('YES')
else:
  print('NO')
N = int(input())

A = input().split()
B = set(A)

print("YES" if len(A) == len(B) else "NO")
N = int(input())
S = set(map(int, input().split()))
if len(S) == N:
  print("YES")
else:
  print("NO")
n=int(input())
lst=list(map(int,input().split()))
a=set(lst)
print("YES" if len(a)==len(lst) else "NO")
N=int(input())
A=list(map(int,input().split()))
if len(A) != len(set(A)):
  print("NO")
else:
  print("YES")
n=input()
lst=input().split()
if len(lst)==len(set(lst)):
    print("YES")
else: print("NO")
n = int(input())
a = set( map(int,input().split()) )
if len(a)==n :
    print('YES')
else :
    print('NO')
n = int(input())
s = list(map(int, input().split()))

if len(s) == len(set(s)):
    print('YES')
else:
    print('NO')
n, *a = map(int, open(0).read().split())
print("YNEOS"[len(set(a))!=len(a)::2])
n = int(input())
a = list(map(int, input().split(' ')))
dictionary = {}
for i in range(n):
    if a[i] in dictionary:
        dictionary[a[i]] += 1
        if 2 <= dictionary[a[i]]:
            print("NO")
            exit()
    else:
        dictionary[a[i]] = 1
print("YES")
N=int(input())
A=[int(i) for i in input().split()]
if len(A)==len(set(A)):
    print("YES")
else:
    print("NO")
n=int(input())
a=[]
a=[int(v) for v in input().split()]
a.sort()
dem=0
for i in range(0,n-1):
    if(a[i]==a[i+1]):
        dem+=1
if(dem==0):
    print("YES")
else:
    print("NO")
input()
(*a,) = map(int, input().split())
print(["NO", "YES"][len(a) == len(set(a))])
S = int(input())
N = list(map(int,input().split()))

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