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):
from collections import defaultdict
import sys
N = int(input())

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

C = defaultdict(int)

for a in A:
  C[a] += 1
  if C[a] >= 2:
    print('NO')
    sys.exit()

print('YES')

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    N = I()
    A = LI()
    print("YES" if len(list(set(A)))==len(A) else "NO")


main()

Solution (Python):
n,*a=map(int,open(0).read().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=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=list(map(int,input().split()))

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

Solution (Python):

import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n =INT()

a = LIST()

occ = defaultdict(int)

for el in a:
    occ[el]+=1
flag =0
for o in occ:
    if(occ[o]>1):
        flag = 1
        break
if(flag==1):
    print("NO")
else:
    print("YES")

Solution (Python):
if __name__ == '__main__':

	n = int(input())
	s = set(input().split())

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

Solution (Python):
import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
if c.most_common()[0][1] > 1:
    print('NO')
else:
    print('YES')

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

Solution (Python):
import collections
N = int(input())
number = list(map(int,input().split()))
number_count = collections.Counter(number)
for i,j in number_count.items():
    if j >1:
        print("NO")
        exit(0)
print("YES")

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

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

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


if __name__ == '__main__':
    main()

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

Aset = set(Alist)

if len(Aset) == len(Alist):
    print("YES")
else:
    print("NO")

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

        break
    elif i==N-2:print("YES")

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

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

A_set = set(A)

if len(A_set) == 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())
a = set(input().split())
print('YES' if (len(a) == n) else 'NO')

Solution (Python):
import sys

n = int(input())
a = [int(x) for x in input().split()]
d = set()
for i in a:
    if i in d:
        print("NO")
        exit()
    d.add(i)
print("YES")

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

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

Solution (Python):
from collections import Counter
from sys import exit

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

cnt = Counter(A)

for i in cnt.values():
    if i != 1:
        print("NO")
        exit(0)

print("YES")

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

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

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

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

Solution (Python):
import sys
from collections import defaultdict

sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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

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

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

print("YES")

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):

_, *a = open(0).read().split()
print("YNEOS"[len(a) != len({*a})::2])

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 = list(map(int, input().split()))

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, *A= map(int, read().split())
    
    if len(set(A)) == N:
        print('YES')
    else:
        print('NO')
    
    return


if __name__ == '__main__':
    main()

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(0)
print("YES")

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

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


print("YES" if len(x) == len(a) else "NO")

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

Solution (Python):
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')

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

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

if count > 0:
  print('NO')
if count == 0:
  print('YES')

Solution (Python):
import math
import collections

def main():
  N = int(input())
  A = map(int, input().split())
  
  l = collections.Counter(A)
  
  for key,value in l.items():
    if value >= 2:
      print('NO')
      return
  print('YES')
    
    
  
main()

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

Solution (Python):



num = int(input())
p = list(map(int, input().split()))
list.sort(p)

ret = "YES"
for i in range(num-1):
    if p[i] == p[i+1]:
        ret = "NO"
        break

print("{}".format(ret))

Solution (Python):
_ = 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(input().split())
B = set(A)
if len(A) == len(B):
    ans = "YES"
else:
    ans = "NO"
print(ans)

Solution (Python):
N=int(input())
A=sorted(list(map(int,input().split())))
flag = False
for i in range(1,N):
  if A[i] == A[i-1]:
    flag = True
if flag:
  print("NO")
else:
  print("YES")

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

A_set = set(A)

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

Solution (Python):
from collections import Counter

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

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
dic={}
for i in range(N):
  if(A[i] not in dic):
    dic[A[i]]=1
  else:
    print("NO")
    exit()
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')
        exit()
print('YES')

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()))
print('YES' if len(set(A)) == len(A) else 'NO')

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

set_A = set(A)

if len(A) == len(set_A):
  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):
n=int(input(''))
a=list(map(int,input('').split(' ')))
b={}
for i in range(n):
    if str(a[i]) in b:
        b[str(a[i])]+=1
    else:
        b[str(a[i])]=1

ok=1
for i in b:
    if b[i]>=2:
        ok=0
        break

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

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

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

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

Solution (Python):
n = int(input())
As = list(map(int, input().split()))
def has_duplicates(seq):
    return len(seq) != len(set(seq))

if not has_duplicates(As):
    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):
N = int(input())
Alist = list(map(int, input().split()))
setAlist = set(Alist)
if (len(Alist) == len(setAlist)):
  print("YES")
else:
  print("NO")

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

MAX = 0
A_map = {}
for i in range(N):
    num = A[i]
    A_map[num] = A_map.get(num,0) + 1
    MAX = max(MAX, A_map[num])

if MAX>=2:
    print('NO')
else:
    print('YES')

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

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

if len(set(an))==n:
    print('YES')
    exit(0)

print('NO')

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

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

Solution (Python):
from collections import Counter

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

for c in cnt.values():
    if c > 1:
        print("NO")
        exit()

print("YES")

Solution (Python):
a=int(input())
b=input()
c=list(b.split(' '))
c.sort()
for i in range(0,len(c)-1):
    if c[i]==c[i+1]:
        print('NO')
        break
    if i==len(c)-2:
        print('YES')

Solution (Python):
def main():
    n = int(input())
    inlis = list(map(int, input().split()))
    inset = set(inlis)

    if len(inlis) == len(inset):
        print("YES")
    else:
        print("NO")
    
    
if __name__ == "__main__":
    main()

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

for a in A:
    if a in s:
        print('NO')
        break
    s.add(a)
else:
    print('YES')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A.sort()
count = 0
di = A[0] + 111
for i in A:
    if di != i:
        count += 1
    di = i
if count == N:
    print("YES")
else:
    print("NO")

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

Solution (Python):
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")

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

Solution (Python):
mod = int(1e9+7)
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
    n = int(raw_input())
    
    arr = [int(x) for x in raw_input().split()]
    
    s = set(arr)
    
    if len(s) == len(arr):
        print('YES')
    else:
        print('NO')
    

main()

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

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

st = set(s)

if len(st) == 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(0)
print('YES')

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

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

Solution (Python):
import collections

N=int(input())
A=list(map(int,input().split()))
a=collections.Counter(A).most_common()
print("YES" if a[0][1]==1 else "NO")

Solution (Python):
import sys

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

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

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

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

a_s = set()
for a in al:
    if a in a_s:
        print('NO')
        break
    a_s.add(a)
else:
    print('YES')

Solution (Python):
import sys
n = int(input())
l = [int(x) for x in input().split()]
l.sort()
for i in range(n):
  if(i == n-1):
    continue
  elif(l[i] == l[i + 1]):
    print('NO')
    sys.exit()
print('YES')

Solution (Python):
i=input;print(['NO','YES'][int(i())==len(set(i().split()))])

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

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

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
List = list(map(str, input().split()))
import collections
c = collections.Counter(List)

if len(c)==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())
a=list(map(int,input().split()))
ans='YES'
a.sort()
for i in range(n-1):
    if a[i]==a[i+1]:
        ans='NO'
        break
print(ans)

Solution (Python):
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]:
        check=0
        break
if check==0:
    print("NO")
else:
    print("YES")

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

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

Solution (Python):
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")

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

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

Solution (Python):
n = int(input())
s = [int(i) for i in input().split()]
s.sort()
flag = False
for i in range (0,n-1):
  if s[i] == s[i+1]:
    flag = True
    break
if flag == True:
  print("NO")
else: print("YES")

Solution (Python):
n=int(input())
a=[int(i) for i in input().split()]
cnt={}
for i in range(n):
    cnt[a[i]]=0
ok=1
for i in range(n):
    cnt[a[i]]+=1
    if cnt[a[i]]==2:
        print("NO")
        ok=0
        break
if ok==1:
    print("YES")

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

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
dic = {}
for a in A:
    if a not in dic:
        dic[a]=1
    else:
        print('NO');exit()
print('YES')

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate,combinations,permutations

from heapq import heapify,heappop,heappush


from functools import lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

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

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




if __name__ == "__main__":
    main()

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

Solution (Python):
n = int(input())
nums = list(map(int, input().split()))
if len(set(nums)) == len(nums):
  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=list(map(int,input().split()))

A_set=set(A)

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

Solution (Python):

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

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

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

s_number = set(number)

print("YES" if len(number) == len(s_number) else "NO")

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

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
ASet = set(A)
if len(A)==len(ASet):
    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())
lis = [x for x in input().split()]
lis.sort()

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

Solution (Python):
N=int(input())
*A,=map(int,input().split())
print('YES'if N==len(set(A))else'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):
def actual(n, A):
    if len(set(A)) == len(A):
        return 'YES'

    return 'NO'


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

print(actual(n, A))

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

Auni = set(A)

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

Solution (Python):
already = {}
n = int(input())
a = list(map(int, input().split()))
for x in a:
    if already.get(x):
        print("NO")
        break
    already[x] = True
else:
    print("YES")

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

Solution (Python):
def solve():
  N = int(input())
  A = list(map(int, input().split()))
  A.sort()
  for i in range(1, N):
    if A[i - 1] == A[i]:
      print('NO')
      return
  print('YES')
  return
solve()

Solution (Python):

N = int(input())
A = list(map(int,input().split()))
flag = True
a = set(A)
if len(a) != 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')
        exit()

print('YES')

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 = list(map(int,input().split()))
list.sort(a)
y = True

for i in range(n - 1):
    if a[i] == a[i + 1]:
        y = False
        break
        
if y:
    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 = list(input().split())

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

Solution (Python):
from collections import Counter


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

if max(cnt.values()) == 1:
    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):
import collections

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

a = collections.Counter(A)

if 1 < max(a.values()):
    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):
import collections
N = int(input())
A = list(map(int, input().split()))
cnt = collections.Counter(A)
 
if cnt.most_common()[0][1] > 1:
    print('NO')
else:
    print('YES')

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

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

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

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

Solution (Python):
dic = {}
flag = 0

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

for num in A:
    if num in dic:
        flag += 1
    else:
        dic[num] = 1

if flag == 0:
    print('YES')
else:
    print('NO')

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

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

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

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

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

Solution (Python):
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'
    break
print(ans)

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

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

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

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
S = 'YES'
for i in range(N-1):
  if A[i] == A[i+1]:
    S ='NO'
    break
print(S)

Solution (Python):


N =int(input())


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

l.sort()
f=1
for i in range(0,N-1):
    
    if l[i]==l[i+1]:
        f=0
        break


if f!=0:
        print("YES")

else:
        print("NO")

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

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
from collections import Counter
ca=Counter(a)
for v in dict(ca).values():
  if v>1:
    print('NO')
    exit(0)
print('YES')

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

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

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    N = II()
    A = LI()
    numa = len(set(A))
    
        
    if numa == N:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
	main()

Solution (Python):



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

a.sort()

repeated = False
for i in range(len(a)-1):
    if a[i] == a[i+1]:
        repeated = True
        break

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

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

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

Solution (Python):
from collections import Counter
N = int(input())
A = list(map(int,input().split()))
c = Counter(A)
if c.most_common()[0][1] >= 2:
    print("NO")
else:
    print("YES")

Solution (Python):
N=int(input())
S=list(map(int,input().split()))
dic={}
for i in range(N):
    dic[S[i]]=1

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

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

A_list_new = list(set(A_list))

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

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

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

S.sort()
banpei=0
for i in range(N):
    if banpei==S[i]:
        print("NO")
        exit()
    else:
        banpei=S[i]
    
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())
x=list(map(int,input().split()))
from collections import Counter
ans=Counter(x)


import sys
for i in ans:
  if ans[i]!=1:
    print("NO")
    sys.exit()

print("YES")

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):

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

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

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

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
s = set(A)
if len(A) == len(s):
    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):
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.sort()
s=""
r=0
for m in a:
  if m == s:
    r=1
  s=m
if r ==1:
  print("NO")
else:
  print("YES")

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