peterverebics/CodeNet_Python_118 huggingface dataset:
n = int(input())
a = list(map(str,input().split()))
ans = 'YES'
for i in range(n):
    if a.count(a[i]) != 1:
        ans = 'NO'
    break
print(ans)
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)
n = int(input())
a = sorted([int(i) for i in input().split()])
ans = 'Yes'
for i in range(1, n):
  if a[i-1] == a[i]:
    ans = 'No'
    break
print(ans)
input()

a=list(map(int, input().split())) #スペース区切りの数字をlistで取得

if int(len([i for i in a if a.count(i) >= 2])) !=0:
    print("No")
else :
    print("Yes")
N, A = int(input()), list(map(int, input().split()))
print("Yes" if len(set(A)) == len(A) else "No")
n = int(input())
a = list(map(int,input().split()))
a=sorted(a)
for idx, i in enumerate(a[:-1]):
    if i == a[idx+1]:
        print('NO')
        break
if idx == n - 2:
    print('YES')
#入力
N = int(input())
li = list(map(int,input().split()))


S = 0
for i in range(9):
    if li.count(i) <2:
        S = S
    else:
        S = S + 1
if S == 0:
    print('Yes')
else:
    print('No')
n=int(input())
l1=list(map(int,input().split()))
l2=set(l1)
if len(l1)==len(l2):
    print("Yes")
else:
    print("No")
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:
    "YES"
else:
    "NO"
N = input()
A = list(map(int, input().split()))
if len(A) == len(set(A)):
    print("Yes")
else:
    print("No")
N = int(input())
A = [int(x) for x in input().split()]

# N=6
# A = [4,1,3,1,6,2]


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

distinct = True
dic = {}

for x in a:
    if x in dic:
        distinct = False
        break
    dic[x] = True

if distinct:
    print("YES")
else:
    print("NN")
def solve(n, a):
    for i in range(n-1):
        if a[i] == a[i+1]:
            return "NO"
    return "YES"

n = int(input())
a = list(map(int, input().split()))
print(solve(n, a))
n = int(input())
A = list(map(int, input().split()))
dic = {}
print(len(A))
j = True

for i in range(0, len(A)):
  if str(A[i]) in dic:
    print("NO")
    j = False
    break
  else:
    dic.setdefault(str(A[i]), A[i])

if j:
  print("YES")
N = int(input())
A = list(map(int, input().split()))
if len(A) == len(set(A)):
    print('Yes')
else:
    print('No')
import sys
from collections import Counter
N=int(input())
l=input().split()
l=Counter(l)
l=l.most_common()
for i in l:
    if i[1]==1:
        continue
    else:
        print('No')
        sys.exit()
print('yes')
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 = list(map(int,input().split()))
a = set(A)
if len(a) == N:
  print('Yes')
else:
  print('No')
Ai = list(map(int,input().split(' ')))
if len(Ai)==len(set(Ai)): print('YES')
else: print('NO')
n = int(input())
li = [int(x) for x in input().split()]

nozoki = list(set(li)).sort()
li.sort()
if (nozoki == li):
    print("YES")
else:
    print("NO")
N = int(input())
numbers = list(map(int,input().split()))
numbers = set(numbers)
if N == len(numbers):
    print('Yes')
else :
    print('No')
n = int(input())
a = list(map(int, input().split()))

a.sort()

bef = a[0]
for i in range(1, n):
    if a[i] == bef:
        print('NO')
        exit(0)
print('YES')
n = int(input())

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

an.sort()

for i in range(n-1) :
    if an[i] == an[i+1] :
        print("No")
        exit()
print("Yes")
n = int(input())
a = list(input().split())
for i in range(n):
  for k in range(i+1,n):
    if a[i] == a[k]:
      print("No")
      exit()
print("Yes")
n=int(input())
table=list(map(int,input().split()))
for i in range(n):
    for j in range(n):
        if (table[i]==table[j]) and (i!=j) :
            print("No")
            exit()
print("Yes")
trash = input()
l = input().split()
l.sort()
for i in range(len(l)-1):
  if ( l[i] == l[i+1] ):
    print("No")
    exit()
print("YES")
import collections
N = int(input())
A = list(map(int,input().split()))
AA = collections.Counter(A)
first_key = next(iter(AA))
first_value = AA[first_key]
if first_value == 1:
  print('YES')
else:
  print('NO')
n = int(input())
a_n = list(map(int, input().split()))

a_n = sorted(a_n)
ans ='Yes'

for i in range(n-1):
  if a_n[i] == a_n[i+1]:
    ans = 'No'
    break
print(ans)
n = int(input())
a = [int(v) for v in input().split()]
a.sort()

flag = True

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

if flag:
    print("Yes")
else:
    print("No")
n = int(input())
a = list(map(int, input().split()))

a_set = set(a)
if len(a) == len(a_set):
    print('Yes')
else:
    print('No')
n=input()
hoge=list(map(int,input().split()))
hoge=set(hoge)
if(n==len(hoge)):
  print("YES")
else:
  print("NO")
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')
N=int(input())
A=list(map(int,input().split()))
list.sort(A)
for i in range(N-1):
    if A[i]-A[i+1]==0:
        print("No")
        exit(0)
    else:
        continue
print("Yes")
num = int(input())
S   = input()
if num%2 == 0:
    print("NO")
else:
    print("YES")
N = int(input())
A = list(map(int, input().split()))
B = list(set(A))

if len(A) == len(B):
    ans = 'YES'
else:
    ans = 'No'

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

if len(a_list) == len(set(a_list)):
    print('Yes')
else:
    print('No')
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')
import sys
input = sys.stdin.readline


def main():
  n = int(input())
  x = tuple(map(int, input().split()))
  length = len(x)
  if n == length:
    print('YES')
  else:
    print('NO')
  

if __name__ == '__main__':
  main()
n = int(input())
a = list(map(int,input().split()))
count = 0

a.sort()

print(a)

for i in range(len(a)-1):
    if(a[i] == a[i+1]):
        print("NO")
        break
    elif(i == len(a)-2):
        print("YES")
s = input().split()
s_set = set(s)
s_ans = list(s)

if s == s_ans:
    print("YES")
else:
    print("NO")
a = int(input())
b = input().split()
mydict = {}
for i in range(len(b)):
    mydict[b[i]] = 1
print(mydict)
if len(mydict) == a:
    print('YES')
else:
    print('NO')
N = input()
A = list(map(int, input().split()))

print('Yes' if N == len(set(A)) else 'No')
N=int(input())
a=list(map(int,input().split()))

a.sort()
flg=0
for i in range(1,N-1):
    if(a[i]==a[i-1]):
        flg=1
if flg==1:
    print("NO")
else:
    print("YES")
n=int(input())
a=list(map(int,input().split()))
if len(a)==len(set(a)):
    print('Yes')
else:print('No')
d1 = int(input())
d = input().split()
d2 = [int(x) for x in d]
count=0
d2.sort()
for x in range(d1-1):

    if d2[x]==d2[x+1]:
        count+=1
        print("NO")

if count==0:
    print("YES")
N = int(input())
A = list(map(int,input().split()))

A = sorted(A)

for i in range(len(A)-1):
    if A[i] == A[i+1]:
        print("No")
        exit()

print("Yes")
N = int(input())
A = list(map(int, input().split()))
B = False
for x in A:

    if A.count(x) > 1:
        B = False
        break
    
    elif N == x:
        B = True
        break
if B:
    print("YES")
else:
    print("NO")
N = int(input())
A = list(map(int,input().split()))
if len(A) != len(set(A)):
    print("No")
else:
    print("Yes")
N = input()
A = list(map(int,input().split()))
ans = "YES"
for i in range (len(A)):
    for j in range(i, len(A)):
        if A[i] == A[j]:
            ans = "NO"
print(ans)
hoge = int(input())
n = list(map(int,input().split()))
ans = "YESt"
count = 0

for i in n :
    
    for j in n :
        if i == j :
            count += 1
    
    if count >= 2 :
        ans = "NO"
    
    count = 0

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

iranai  =input()
l   =   input()
print(has_duplicates(l))
# -*- coding: utf-8 -*-
def main():
    StringN = input();
    listA = input().split();
    listA.sort();
#    newlistA = sorted(listA);
#    print(newlistA);

    for i in range(int(StringN)-1):
#        print(newlistA[i]);
#        print(newlistA[i+1]);
        if listA[i] == listA[i+1]:
            print('No');
#            print (i)
            return 0;
    print('Yes');


main();
a=int(input())
b=list(map(int,input().split()))
d=len(b)
c=set(b)
if len(c)==d:
  print('NO')
else:
  print('YES')
n=int(input())
a=list(map(int,input().split()))
s="NO"
for i in range(n):
    for j in range(i+1,n):
        if a[i]==a[j]:
            s="YES"
            break
print(s)
n =input()
m = list(map(int,input().split()))
if len(m) == len(list(set(m))):
    print('Yes')
else:
    print('No')
# coding: utf-8
# Your code here!

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()))
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()))
def has_duplicates2(seq):
    seen = []
    unique_list = [x for x in seq if x not in seen and not seen.append(x)]
    return len(seq) != len(unique_list)
print("YES" if has_duplicates2(a) else "NO")
N=int(input())
S=set(map(int,input().split()))
print('YES' if N==len(S) else 'N0')
n = int(input())
a_list = list(map(int, input().split()))
ans = 'Yes'
cheacked = []

for i in a_list:
    if i in cheacked:
        ans = 'No'
        break
    else:
        cheacked.append(i)
        
print(ans)
n = int(input())
a = list(map(int, input().split()))

past = -1
can = True

for ai in a:
    can &= ai != past
    past = ai

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

flg = 1
for i in range(N):
  if A[i] in A[i+1:]:
    print("No")
    flg= 0
    break
if flg:
  print("Yes")
def main():
    n = input()
    an = set(map(int,input().split()))
    
    if n == len(an):
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
  	main()


'''
6
4 1 3 1 6 2
'''
N = int(input())
A = list(map(int, input().split()))

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

l = A
if has_duplicates(l):
    print("No")
else:
    print("Yes")
n = int(input())
l_set = set(input().split())
if n == len(l_set):
    print("Yes")
else:
    print("No")
N = int(input())
A = [int(x) for x in input().split()]

flag = True

while flag:
    for i in range(N-1):
        for j in range(i+1, N):
            if A[i] == A[j]:
                print('No')     
                flag = False      
while flag:
    print('Yes')
n,*l=open(0).read().rstrip()

print("YES" if int(n)==len(set(int(g) for g in l if g not in ["\n"," "])) else "NO")
N = int(input())
inList = list(map(int, input().split()))

inList.sort()

noFlag = 0

for indx in range(len(inList) - 1):
  if inList[indx] == inList[indx + 1]:
    print("No")
    noFlag = 1
    break

if noFlag == 0:
  print("Yes")
n = int(input())
a = list(map(int,input().split()))
x = 0
for i in range(n):
    if a.count(a[i]) != 1:
        print("No")
        x = 1
        break
        
if x == 0:
    print("Yes")
N = int(input())
A = map(int, input().split())
A = sorted(A)
b = 0

for a in A:
    if b == a:
        print('No')
        exit()
    else:
        b = a
print('Yes')
N = int(input())
A = list(map(int, input().split()))

A.sort()

isSame = False

for i in range(N - 1):
  if A[i] == A[i + 1]:
    isSame = True
    break
if isSame:
  print('YES')
else:
  print('NO')
N=int(input())
data=list(map(int, input().split(' ')))
A=len(data)
data=list(set(data))
B=len(data)
if A==B:
    print('Yes')
else:
    print('No')
i = input()
n = list(map(int, input().split()))
print("Yes") if len(n) == len(set(n)) else print("No")
N=int(input())
A=list(map(int,input().split()))

B=set()

if len(B)==len(A):
  print("NO")
else:
  print("YES")
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 = [int(i) for i in input().split()]

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

c = [0]*n
flag = 0
c[0] = a[0]
for i in range(n):
  for j in range(i):
    if c[j] == a[i]:
      flag = 1
      break
    else:
      c[i] = a[i]

print(c)
if flag == 0:
  print("YES")
else:
  print("NO")
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
B=Counter(A)
if len(A)==len(B):
	print('Yes')
else:
	print('No')
input()
words = input().split(" ")
for i, w in enumerate(words):
  for ii, ww in enumerate(words):
    if i != ii and w == ww:
      print("YES")
      exit()
print("NO")
n=int(input())
a=list(map(int,input().split()))

s=set(a)
print('Yes' if len(s)==len(a) else 'No')

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

# if has_duplicates(a) == True:
#   print('No')
# elif has_duplicates(a) == False:
#   print('Yes')

# # for i in range(n-1):
# #   if a[i] == a[i+1]:
# #     print('No')
# #     exit()

# # print('Yes')
import collections

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

c = collections.Counter(A)

ans = all([True for k, v in c.items() if v == 1])

if ans:
    print('Yes')
else:
    print('No')
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
flag=False
for j in range(n):
  if j<n-1:
    if a[j]==a[j+1]:
      flag=True
      break
if flag:
  print('No')
else:
  print('Yes')
N=int(input())
A=list(map(int,input().split()))
list.sort(A)
for i in range(N-1):
    if A[i]-A[i+1]==0:
        print("No")
        exit(0)
print("Yes")
n = int(input())
a = set(map(int, input().split()))
if len(a) == n:
    print('Yes')
else:
    print('No')
N=int(input())
A=list(map(int,input().split()))

a=True
for i in range(N):
    b=A[0]
    A.remove(b)
    if (b in A)==True:
        print("No")
        a=False
        break
if a==True:
    print("Yes")
t=list(input().replace(" ",""))
n=len(t)
p=0
for i in range(1,n):
    for j in range(1,i-1):
        if t[i]==t[j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")
import sys

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

A.sort()
i = 0
while i<N-1:
    if A[i]==A[i+1]:
        print('No')
        sys.exit()
    else:
        i = i+1
print('Yes')
n = int(input())

a = list(map(int, input().split()))
ngcounter = 0
for i in range(n):
  if a[i] in a :
    ngcounter += 1
    break
    
if ngcounter > 0:
  print("No")
else:
  print("Yes")
n = int(input())
a = input().split()
b = len(set(a))
print(b)
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")
else:
  print("No")
s = input()
a = map(int, input().lower().split())

if int(s) == len(set(a)):
  print("YES")
else:
  print("NOr")
n = int(input())
a = [int(x) for x in input().split()]
a.sort()
flag = 0
for i in range(n-1):
    if a[i] == a[i+1]:
        flag = 1
if flag:
    print('No')
else:
    print('Yes')
import collections
a=int(input())
b=input()
c=collections.Counter(b)
n,values=zip(*c.most_common())
d=list(values)
del d[0]
if d.count(1)==a:
    print('YES')
else:
    print('NO')
n = 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")
import copy

N = input()
list1 = list(map(int, input().split()))
list2 = copy.copy(list1)
list3 = set(list1)

x=len(list2)
y=len(list3)

if x==y:
    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())
arr=[int(x) for x in input().split()]
arr1=set(arr)
if arr1==arr:
  print("YES")
else:
  print("NO")
# 入力、宣言
intLen=int(input())
intList=sorted(list(map(int,input().split())))

result="Yes"

# 処理
# 対象項目と次の項目を比較
for i in range(len(intList)-1):
    if intList[i]==intList[i+1]:
        result="No"

# 出力
print(result)
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    for j in range(n - i - 1):
        if a[i] == a[i + j + 1]:
            print("No")
            x = 1
            break
 
if x == 0:
    print("Yes")
N = int(input())
A_list = list(map(int, input().split()))
A_list_len = len(A_list)

A_set = set(A_list)
A_set_len = len(A_set)

if A_list_len == A_set_len:
    print('Yes')
else:
    print('No')
n= int(input())
a = list(map(int,input().split()))
for i in range(n-1):
  for j in range(i+1,n):
    if a[i]==a[j]:
      print("No")
      quit()
print("Yes")
N = int(input())
A = (int(x) for x in input().split())
flag = False

def f(x, l):
  if x in l:
    flag = true

map(f, A)

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

a=0
for i in A:
  if A.count(i)>=2:
    print("No")
    a=1
    break

if a==0:
  print("Yes")
N = int(input())
A = list(map(int,input().split()))

counter = 0
for i in range(N):
    for j in range(N):
        if A[i] == A[j]:
            counter += 1

#print(counter)
if counter > N:
    print('No')
else:
    print('Yes')
# coding: utf-8
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()
n = int(input())

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

an.sort()

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

else :
    print("Yes")
n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
error=False
    
for i in range(n):
    if len(deta)==0:
        pass
    elif error:
        break
    elif a[i] in deta:
        error=True
    deta.append(a[i])
if error:
    print("YES")
else:
    print("NO")
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")
n = int(input())
a = list(map(int, input().split()))

s = {}
flag = 0

for i in range(n):
    t = a[i]
    s.setdefault(t, 0)
    if s[t] == 0:
        s[t] = 1
    else:
        print("No")
        flag = 1
        break

if flag == 0:
    print("Yes")
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    n = int(sys.stdin.readline())
    A = list(map(int,sys.stdin.readline().split()))
    num_dict = {}
    flag = True
    for x in A:
        if not x-1 in num_dict:
            num_dict[x-1] = x-1
        else:
            flag = False
            break
    print("Yes") if flag else print("No")
    return 0

if __name__ == "__main__":
    main()
N = int(input())
lisA = [int(i) for i in input().split()]
if len(set(lisA)) == len(lisA):
    print('Yes')
else :
    print('No')
n = int(input())
s = set(map(int, input().split()))
print("Yes" if len(s) == n else "No")
N = int(input())
List = list(map(str, input().split()))
import collections
c = collections.Counter(List)
print(c)
if len(c)==N:
    print('YES')
else:
    print('NO')
def print_ans(N, ar):
    print(1)
if __name__ == '__main__':
    N = int(input().rstrip())
    ar = list(map(int,input().rstrip().split()))
    print_ans(N, ar)
def solve():
    N = int(input())
    A = set(map(int,input().split()))
    if len(A) == N:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()
n = input()
a = input().split()
n = int(n)
a = [int(s) for s in a]
a.sort()

s=0

for i in range(len(a)-1):
    if a[i]==a[i+1]:
        print("YES")
        s=s+1
        
if s == 0: print("NO")
n = int(input())
a = list(map(int, input().split()))
b = sorted(a)
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()))

A.sort()
for i in range(N-1):
    if A[i]==A[i+1]:
        print("NO")

print("YES")
# -*- coding: utf-8 -*-
N = int(input())
A_list = list(map(int, input().split()))

print("Yes" if len(A_list) == len(set(A_list)) else "No")
n=int(input())
a=[int(x) for x in input().split()]

if len(a) != set(a):
    print("NO")
else:
    print("YES")
n=int(input())
a=list(map(int,input().split()))
if a.sort()==set(a):
  print('YES')
else:
  print('NO')
n=int(input())
a=[int(v) for v in input().split()]
check=1
a.sort()
for i in range (0,n-1):
    if a[i]==a[i+1]:
        kt=0
        break
if check==0:
    print("NO")
else:
    print("YES")
N = input()
list_1 = list(map(int,input().split()))

list_2 = list(set(list_1))

list_1.sort()

if list_1 == list_2:
    print('YES')
else:
    print('NO')
N = int(input())
A = list(input().split())
c = 0
for i in range(N-1):
  num = A.count(A[i])
  if num>=2:
    break
  else:
    c += 1
if c == 0:
  print("NO")
else:
  print("YES")
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
A = set(A)
print(len(A))
if N == len(A):
    print("YES")
else:
    print("NO")
s = input()
a = map(int, input().lower().split())
a = list(a)
a.sort()
if a == list(set(a)):
  	print("YES")
else:
  	print("NO")
import sys

N = int(input())
d = list(map(int, input().split(" ")))

newList = list(dict.fromkeys(d))

if d == newList:
  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())
num = input().split()

def check():
  for s in num:
    if(num.count(s) >= 2):
      print("No")
      return
  print("Yes")

check()
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()))

set_a = list(set(a))

if len(set_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")
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()))
setA = set(A)
print("Yes" if len(setA)==len(A) else "No")
from collections import Counter

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

if [1 ** N] == Counter(A).values():
    print("Yes")
else:
    print("No")
n = int(input())
a = list(map(int, input().split()))

b = list(set(a))

if sorted(a) == sorted(b):
  print('Yes')
else:
  print('No')
import collections
N = int(input())
lsA = list(map(int,input().split()))

cout = collections.Counter(lsA)
ans = 'Yes'
for i in cout.values():
    if i > 1:
        ans = 'No'
        break

print(ans)
input()
a = input().split()

x = {}
for i in a:
    if x.get(i, False):
        print("No")
        break
    x[i] = True
else:
    print("Yes")
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")
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()))
s = set(A)
if len(A) == len(s):
    print("YES")
else:
    print("No")