peterverebics/CodeNet_Python_118 huggingface dataset:
N = int(input())

num_set = set(int(i) for i in input().split())

if len(num_set) == N:
    print('YES')
else :
    print('NO')
n = 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")
def resolve():
    N = 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")

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

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

if len(set(A)) == N:
    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())

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

b.sort()
for i in range(n-1):
  if b[i]==b[i+1]:
    print("NO")
    break
  if i==n-2:
    print("YES")
N = int(input())
A = [int(x) for x in input().split()]
A.sort()

ans = 'YES'

for i in range(N-1):
    if A[i] == A[i+1]:
        ans = 'NO'
        break
print(ans)
n = int(input())
a = [int(i) for i in input().split()]
new_a = set(a)
if len(new_a) != n:
    print("NO")
else:
    print("YES")
N = int(input())
print('YES' if N==len(set(map(int, input().split()))) else 'NO')
def main():
    N = int(input())
    List = list(map(int,input().split()))
    Set = set()
    for i in List:
        if i in Set:
        	print('NO')
        	return
        Set.add(i)
    print('YES')
    return
main()
N = int(input())
A = [int(x) for x in input().split()]
A.sort()
for i in range(N - 1):
  if A[i] == A[i + 1]:
    print("NO")
    break
else:
  print("YES")
N = int(input())
arr = list(map(int, input().split()))
if len(set(arr)) == len(arr):
    print('YES')
else:
    print('NO')
N = int(input())
A = [int(x) for x in input().split()]
ans = set()
for i in range(N):
    ans.add(A[i])
if len(ans) == N:
    print("YES")
else:
    print("NO")
n=int(input())
A=list(map(int,input().split()))



print("YES" if len(set(A))==len(A) else "NO")
from collections import Counter
N = int(input())
A = Counter(map(int, input().split()))
A = A.values()
for a in A:
    if a != 1:
        print("NO")
        exit()
print("YES")
N=int(input())
li = list(map(int,input().split()))	
num = {}
for l in li:
    if str(l) not in num :
        num[str(l)] = 1
    elif num[str(l)]==1:
        print("NO")
        break
else:
    print("YES")
n = int(input())
a = list(map(int, input().split())) # list()でリスト化、それを変数に代入。
onazi = False

a.sort()

for i in range(n-1):
    if a[i]==a[i+1]:
        onazi = True
        break

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

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

N = int(input())
n = list(map(int, input().split()))
c = collections.Counter(n)

cnt = c.most_common()

for c in cnt:
  if (c[1]>1):
  	print('NO')
  else:
    print('YES')
  break
N = int(input())
A = list(map(int, input().split()))
setA = set(A)
if(len(A) == len(setA)):
    print('YES')
else:
    print("NO")
def main():
    n = int(input())
    a = [int(x) for x in input().split()]
    a_s = set(a)
    if len(a) == len(a_s):
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()
N = int(input())
A = list(map(int, input().split()))
if len(A)== len(set(A)):print("YES")
else:print("NO")
def resolve():
    n = int(input())
    a = set(map(int, input().split()))

    if len(a) == n:
        print('YES')

    else:
        print('NO')

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

aa = set(a)

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

if len(s) == N:
    print("YES")
else:
    print("NO")
def distinct_or_not_2(a_list):
    a_list.sort()
    for i in range(len(a_list)-1):
        if a_list[i] == a_list[i+1]:
            return 'NO'
    return 'YES'

n = int(input())
a_list = [int(a) for a in input().split()]

print(distinct_or_not_2(a_list))
n = int(input())
a = list(map(int, input().split()))
print(['NO','YES'][len(set(a))==n])
N = int(input().rstrip())
As = [int(x) for x in input().rstrip().split()]

d = {}
for x in As:
    if x not in d.keys():
        d[x] = 1
    else:
        d[x] += 1
if len(As) == len(d):
    print('YES')
else:
    print('NO')
n = int(input())
al = list(map(int,input().split()))

if len(al) == len(set(al)):
    print("YES")
else:
    print("NO")
i1 = input()
i2 = input()

i_sp = i2.split(' ')
len_i = len(i_sp)
set_i = set(i_sp)

if(len_i == len(set_i)):
    print('YES')
else:
    print('NO')
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')
from sys import stdin

if __name__ == '__main__':
    N = int(stdin.readline().rstrip())
    A = stdin.readline().rstrip().split()
    ori_len = len(A)
    setA = set(A)
    set_len = len(setA)
    if ori_len == set_len:
        print('YES')
    else:
        print('NO')
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    A=LI()
    A.sort()
    flag=1
    for i in range(N-1):
        if A[i]==A[i+1]:
            flag=0
            break
        
    if flag:
        print("YES")
    else:
        print("NO")

main()
N = int(input())
A_ls = map(int, input().split(' '))
rst = set()
for i in A_ls:
    rst.add(i)
if len(rst) == N:
    print('YES')
else:
    print('NO')
from collections import Counter
n = int(input())
a = list(map(int,input().split()))
l1 = len(a)
dic = Counter(a)
l2 = len(dic)
if l1 == l2:
  print('YES')
else:
  print('NO')
N = int(input())
Alist = list(map(int, input().split()))

Aset = set(Alist)

if len(Aset) == len(Alist):
    print("YES")
else:
    print("NO")
num = int(input())
arr = [int(i) for i in input().split()]
l = len(set(arr))
if num == l :
  print("YES")
else :
  print("NO")
N = list(input().split())
A = list(map(int, input().split()))
A.sort()
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()))

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

b = set(A)
B = list(map(int, b))

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

if len(set(a))==n:
  print("YES")
else:
  print("NO")
first_int = int(input())
secound_list = [int(k) for k in input().split()]

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

if has_duplicates(secound_list) == False:
  print('YES')
else:
  print('NO')
N = int(input())
A = list(map(int, input().split()))

a_count = len(A)
a_uni_count = len(list(set(A)))

result = 'YES' if (a_count == a_uni_count) else 'NO'
print(result)
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

n = inn()
h = {}
a = inl()
for i in range(n):
    if a[i] in h:
        print('NO')
        exit()
    h[a[i]] = 1
print('YES')
import sys
n=int(input())
l= input().split()
leng=len(l)
flag="NO"

for i in range(leng):
  #print(i)
  for ii in range(i+1, leng):
    #print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
      sys.exit()
    else:
      flag = "YES"

print(flag)
n = input()
a = set(map(int, input().split()))

if len(a) == n:
  print('Yes')

else:
  print('No')
n = int(input())
a = input().split(" ")

flag = False
for i in range(n-1):
    for j in range(i, n):
        if a[i] == a[j]:
            Flag = True
            break
    if flag:
        break

print('NO' if flag else 'YES')
N = input()
a = input()
M = list(map(int, a.split()))

X = set(M)
Y = len(X)

if N == Y:
    print("YES")
else:
    print("NO")
n = input()
l = list(map(int,input().split()))
l.sort()

if len(l) == len(set(l)):
    print('Yes')
else:
    print('No')
n=int(input())
num=[int(i) for i in input().split()]

if len(num)==len(set(num)):
  print('Yes')
else:
  print('No')
n = int(input())
b = (int(x) for x in input().split())
a = list(b)
x = 0
for i in range(n):
    if a.count(a[i]) != 1:
        print("Yes")
        x = 1
        break

if x == 0:
    print("No")
N=int(input())
A=list(map(int,input().split()))
tmp=set(A)
tmp=list(tmp)


if len(tmp)==len(A):
  print ("Yes")
else:
  print ("No")
N = input()
words = list(input().split())

if len(words) == N:
  print('YES')
else:
  print('NO')
from collections import defaultdict
n = int(input())
d = defaultdict(int)
A = list(map(int,input().split()))

for a in A:
    if d[a] == 1:
        print('No')
        exit()
    else:
        d[a] += 1

print('Yes')
N = int(input())
l = sorted([int(x) for x in input().split()])
ans = 'YES'
for i in range(N-1):
  if l[0] == l[1]:
    ans = 'NO'
print(ans)
s = int(input())
l = [int(n) for n in input().split()]
l = sorted(l)
flag = 0
print(l)
for i in range(len(l)- 1):
  if l[i] == l[i+1]:
    print("NO")
    flag = 1
    
if flag == 0:
  print("YES")
from sys import stdin


def get_result(data):
    N, A = data[0], data[1]
    return 'Yes' if len(list(set(A))) == len(A) else 'NO'

if __name__ == '__main__':
    raw_data = [val.rstrip('\n') for val in stdin.readlines()]
    data = [list(map(int, val.split(' '))) for val in raw_data]
    result = get_result(data)
    print(result)
import heapq

N = int(input())
A = list(map(int, input().split()))
res = "YES"
heapq.heapify(A)
for i in range(len(A)):
    if i == 0:
        continue
    if A[i] == A[i-1]:
        res = "NO"
        break
    else:
        continue
print(res)
n=int(input())
A=list(map(int,input().split()))

cnt=0
for i in range(n):
    for j in range(i+1,n):
        if A[j]!=A[i]:
            cnt+=1
print(cnt)
if cnt>1:
    print("No")
else:
    print("Yes")
count = int(input())
n_sequence = sorted([int(x) for x in input().split()])

for n in range(count):
    if (n_sequence[n-2] == n_sequence[n-1]) or (n_sequence[n-1] == n_sequence[n]) \
       or (n_sequence[n-2] == n_sequence[n]):
        print("NO")
        break
else:
    print("YES")
n=int(input())
li=list(map(int, input().split()))
ans="Yes"
for i in range(n):
  for j in range(i+1, n):
    if li[i]==li[j]:
      ans="No"
      break
  else:
    continue
  break
print(ans)
n = int(input())
a = input().split()
x = 0
for i in a:
    b = a.pop(0)
    if b in a:
        x += 1
        break
if x == 1:
    print("No")
else:
    print("Yes")
a=int(input())
b=list(input().split())
c=sorted(b)
ans=0
for i in range (a-1):
	if c[i]==c[i+1]:
		print("NO")
		break
	else:
		print("YES")
		break
def has_duplicates(seq):
    if len(seq) == len(set(seq)):
        print("Yes")
    else:
        print("No")
    #return len(seq) != len(set(seq))
N = int(input())
A = list(map(int,input().split()))
has_duplicates(A)
import numpy as np

n = int(input())
A = [int(a) for a in input().split()] 
A.sort()
A.append(-1)

B = [-1] + A[:-1]

A = np.array(A) 
B = np.array(B) 

s = A-B 
ans = len(np.nonzero(s)[0])
if ans == n+1:
  print("Yes")
else:
  print("No")
N = input()
A = set(input().split())

if len(A) == N:
    print("YES")
else:
    print("NO")
from collections import Counter
input()
lst = input().split()
dic = dict(Counter(lst))
x = max(list(dic.values())) - 1
if x:
    print('No')
else:
    print('Yes')
N = int(input())
A = [int(x) for x in input().split()]
if len(A) != len(set(A)):
    print("NO")
else:
    if A.count(N) > 0:
        print("YES")
    else:
        print("NO")
def main():
	n=int(input())
	a=list(map(int, input().split()))
	count=[0]*n
	for i in range(n):
		count[i] = a.count(a[i])
	if sum(count)==0:
		print('YES')
	else:
		print('NO')
main()
def main():
	n = int(input())
	a = list(map(int,input().split()))
	a.sort()
	ans = 0
	for i in range(len(a)-1):
		if a[i] == a[i+1]:
			ans = 1
	if ans == 1:
 		print("No")
	else:
 		print("Yes")
	
 
if __name__ == '__main__':
	main()
n = int(input())
a = list(map(int,input().split()))
a.sort()
tmp = 0
for i in range(n-1):
    if a[i]==a[i+1]:
        tmp = 1
        break
if tmp == 1:
    print('No')
else:
    print('Yes')
N = int(input())
A = list(map(int, input().split()))

flag = 0
for i in range(N-1):
    if A[i] != A[i+1]:
        flag = 0
    else:
        flag = 1

if flag == 0:
    print('YES')
else:
    print('NO')
N = int(input())
A = [int(x) for x in input().split()]
d = []
p = 0
for i in range(N):
    d.append(A[i])
    if A[i] in d:
        p = 1
        break
if p == 0:
    print("YES")
else:
    print("NO")
def has_duplicates(seq):
    return len(seq) == len(set(seq))

iranai  =input()
l   =   input()
if has_duplicates(l)== "TRUE":
	print("YES")
else:
  	print("NO")
n = int(input())
a = list(map(int,input().split()))

x = len(a)
y = len(set(a))

if x == y:
    print('Yes')
else:
    print('No')
N=int(input())
A=list(map(int,input().split()))
p=True
for i in range(1,N):
  if A[i] in A[:i-1]:
    p = False
    break
print("YES" if p else "NO")
A = list(map(int ,input().split(' ')))
print('YES') if len(set(A))==len(A) else print('NO')
n = int(input())
li = list(map(int,input().split()))

li0 = sorted(li)

print(li)
print(li0)

j = 0
for i in range(n):
  if li0[i-1]==li0[i]:
    j = 1

if j == 0:
  print("YES")
else:
  print("NO")
# C
import numpy as np
N = int(input())
A = list(map(int,input().split()))

All_diff=[A[i]-A[j] for i,j in zip(range(N),range(N)) if i<j]   

prod=np.prod(All_diff)

if prod > 0 or prod < 0:
    print("No")
else:
    print("Yes")
r = 0
n = int(input())
a = sorted(list(map(int, input().split())))
for i in range(n - 1):
  if a[i] ==  a[i + 1]:
    r = 1
if r == 1:
  print("No")
else:
  print("Yes")
n = int(input())

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

an = list(an)

if len(set(an)) == n :
    print("Yes")

else :
    print("No")
import sys
n=int(input())
x=list(map(int,input().split()))

c=[]

for i in x:
    if i not in c:
        c.append(i)
    else:
        print('No')
        sys.exit()

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

a.sort(reverse=True)
f = False
for i in range(n-1):
    if a[i+1] - a[i] == 0:
        f = True
        break

if f == True:
    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')
n=int(input())
if len(set(map(int,input().split())))==n:
    print("No")
else:
    print("Yes")
def solve():
    N = int(input())
    array = list(map(int, input().split()))
    if array == list(set(array)):
        print("YES")
    else:
        print("NO")

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

cnt= int(len(A) / 2) + 1
print(cnt)
cnts = 0
isYes = True

for i in A:
    if A.count(i) > 1:
        isYes = False
        break
    else:
        isYes = True
 
    if cnts == cnt:
        isYes = True
        break
    cnts += 1

if isYes:
    print("YES")
else:
    print("NO")
N = input()
A = input().split()

print(A[0] in A[1:])
n = int(input())
a = list(map(int,input().split()))
s_a = set(a)
if n == len(s_a):
    print('Yes')
else:
    print('No')
N = input()
nums = input().split(" ")
nums = [int(i) for i in nums]

if len(set(nums)) == N:
    print("YES")
else:
    print("NO")
n=map(int,input())
lst=len(set(map(int,input().split())))
if n==lst:
    print("YES")
else:  print("NO")
N = int(input())
seq = input().split()

if len(seq) != len(set(seq)):
  print('YES')
else:
  print('NO')
a=int(input())
b=list(input().split())
c=sorted(b)
ans=0
for i in range (a-1):
	if c[i]==c[i+1]:
		print("YES")
		break
	else:
		print("NO")
		break
n = int(input())
l = list(map(int, input().split()))
sl = sorted(l)
if len(l) == len(sl):
    print('YES')
else:
    Print('NO')
n = int(input())
a = list(map(int,input().split()))
b = [0 for _ in range (max(a)+1)]
for i in a:
    b[i]+=1
    if b[i]==2:
        print("No")
        exit()
print("Yes")
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()))
Ans = "Yes"
List = []

for e in A:
    if e in List:
        Ans = "No"
        break
    else:
        List.append(e)

print(Ans)
N=int(input())
A=input()
print(len(set(A)))
if len(set(A))-1==N:
    print("Yes")
else:
    print("No")
def has_duplicates(seq):
    return len(seq) != len(set(seq))


def main():
    n = int(input())
    if has_duplicates(list(map(int, input().split(' ')))):
        print('No')
    else:
        print('Yes')


if __name__ == '__main__':
    main()
n=int(input())
l1=list(map(int,input().split()))
l2=list(set(l1))
L2=len(l2)
print('Yes' if n==L2 else 'No')
import sys
from collections import Counter
N=int(input())
l=input().split()
l=Counter(l)
l=l.most_common()

c=len(l)
d=0

for i in l:
    if i[1]==1:
        d+=1
if d==c:
    print('Yes')
else:
    print('No')
n = int(input())
a = list(input().split())
if len(set(a)) == len(a):
    print('Yes')
else:
    print('No')
N = int(input())
A = list(map(int, input().split()))
A.sort()
#print(A)
yesno = 'NO'
for i in range(len(A)-1):
    if A[i]==A[i+1]:
        yesno = 'YES'
        break
print(yesno)
N=int(input())
A=list(map(int,input().split()))
B=list(dict.fromkeys(A))
if A==B:
    print('Yes')
else:
    print('No')
# -*- coding: utf-8 -*-
def main():
    listA = input();
    newlistA = sorted(listA);

    for i in range(len(newlistA)-1):
        if newlistA[i] == newlistA[i+1]:
            print('No');
            return 0;
        else:
            print('Yes');
            return 0;


main();
from collections import Counter

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

c = Counter(a)

for i in c.values():
    if i > 1:
        re += 1

if re > 0:
    print("No")
else:
    print("Yes")
n=int(input())
a=list(map(int,input().split()))
ans='Yes'
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if a[i]==a[j]:
            print(a[i],a[j])
            ans="No"
            break
print(ans)
def main():
  n = int(input())
  A = sorted([int(x) for x in input().split()])
  for i in range(n-1):
    if A[i] == A[i+1]:
      print("Yes")
      return 0
      break;
      
  print("No")
  return 0
          
if __name__ == "__main__":
  main()
N = int(input())
A = list(map(int, input().split()))
print(A)

count = 0
for i in A:
    for j in A[count+1:]:
        if i == j:
            print("Yes")
            break
    else:
        count += 1
        continue
    break
else:
    print("No")
from collections import Counter
n = int(input())
a = list(map(int,input().strip().split()))
if Counter(a).most_common(1)[0][1] != 1:
    print('No')
else:
    print('Yes')
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    n = int(input())
    A = sorted(readInts())
    dic = {}
    for a in A:
        if a in dic:
            print('No')
            break
        else:
            dic[a] = 1
if __name__ == '__main__':
  main()
def main():

    N = int(input())
    A = list(map(int, input().split()))
    if len(A) == len(set(A)):
        return 'YES'
    return 'No'

if __name__ == '__main__':
    print(main())
n=int(input())
A=list(map(int,input().split()))

cnt=0
for i in range(n):
    for j in range(i+1,n):
        if A[i]==A[j]:
            cnt+=1

if cnt>1:
    print("No")
else:
    print("Yes")
n = int(input())
a = list(map(int,input().split()))
b = set(a)
if b == a:
    print("YES")
else:
    print("NO")
n = int(input())
a = input().split(" ")

flag = False
for i in range(n-1):
    for j in range(n-1):
        if a[i] == a[j]:
            Flag = True
            break
    if flag:
        break

print('NO' if flag else 'YES')
n = int(input())
a = input().split(" ")
b = set(a)
if len(b)<len(a):
  answer = "NO"
else:
  answer = "Yes"
print(answer)
N = int(input())
A = sorted(list(map(int, input().split())))

B =list(set(A))

print('YES' if A == B else 'NO')
import sys
input = sys.stdin.readline

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

if len(set(a)) == n:
    print('Yes')
else:
    print('No')
import collections
N=int(input())
A=list(map(int,input().split()))
A=collections.Counter(A)
A=A.most_common()
na=A[0][1]
if na==1:
  print("Yes")
else:
  print("No")
n = int(input())
a = list(map(int, input().split()))
d = {}

for x in a:
    d[x] = d.get(x, 0) + 1

t = max(d.values())

print("Yes") if t == 1 else print("No")
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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


while True:
    try:
        a = a_list.pop()
    except IndexError:
        print("Yes")
        exit()

    if a in a_list:
        print("No")
        exit()
from collections import Counter
n = int(input())
c = Counter(list(map(int, input().split())))
if len(c) == n:
    print('Yes')
else:
    print('No')
N = input()
A = input().split()

if len(set(A)) == N :
    print('YES')
else:
    print('NO')
n=int(input())
a=list(map(int,input().split()))
if n==len(set(a)):
    print('Yes')
else:print('No')
n = int(input())
s = input().split()
for i in range(n):
  for j in range(i+1, n):
    if s[i] == s[j]:
      break
      print('No')
    elif i == n:
      print('Yes')
n = int(input())
a = list(map(int, input().split()))
sa = set(a)
print("Yes") if len(a) == len(sa) else print("No")
import collections

N = int(input())
n = list(map(int, input().split()))
c = collections.Counter(n)

cnt = c.most_common()

for c in cnt:
  if (c[1]>1):
  	print('No')
  else:
    print('Yes')
  break
a=int(input())
b=[int(i) for i in input().split()]
c=[]
for i in range(len(b)-1):
    if b[i]==b[i+1]:
        c.append(1)
if len(c)>0:
    print('NO')
else:
    print('YES')
N=input()
A = list(map(int, input().split()))
A_set = set(A)

if len(A)==len(A_set):
  print('Yes')
else:
  print('No')
N = int(input())
A = list(input())
SET_A = set(A)
if len(A)==len(SET_A):
    print("YES")
else:
    print("NO")
import collections
N = int(input())
A = list(map(int, input().split())) 
c = collections.Counter(A)

if c.most_common()[0][1] > 2:
  print('YES')
else:
  print('NO')
N=int(input())
A=list(map(int,input().split()))
c=0
for i in range(len(A)):
  if A.count(A[i])==0:
    c=c+1

if c==0:
  print("NO")
else:
  print("YES")
def chk(nums):
  for i in nums:
    for ii in nums:
      if i == ii: return False
  return True
s = map(int, input().split())
if chk(s): print('YES')
else: print('NO')
N = int(input())
A = list(map(int,input().split()))

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

if len(A_list) == len(set(A_list)):
  print("Yes")
else:
  print("No")
from collections import Counter

n = int(input())
a = list(map(int, input().split()))
cnt = Counter(a)
flag = [i for i in cnt.values()]
if len(set(flag)) == 1:
    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")
def has_duplicates(seq):
    return len(seq) != len(set(seq))

N=int(input())
A=list(map(int,input().split()))
if has_duplicates(A):
    print('No')
else:
    print('Yes')
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
if flag:
  print('No')
else:
  print('Yes')