Problem:
 Score : 300 points    Problem Statement Given is a sequence of integers A_1, A_2, ..., A_N .
If its elements are pairwise distinct, print YES ; otherwise, print NO .      Constraints  2 ≤ N ≤ 200000  1 ≤ A_i ≤ 10^9  All values in input are integers.         Input Input is given from Standard Input in the following format:  N  A_1  ...  A_N       Output If the elements of the sequence are pairwise distinct, print YES ; otherwise, print NO .        Sample Input 1 5
2 6 1 4 5      Sample Output 1 YES  The elements are pairwise distinct.       Sample Input 2 6
4 1 3 1 6 2      Sample Output 2 NO  The second and fourth elements are identical.       Sample Input 3 2
10000000 10000000      Sample Output 3 NO

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

setA = len(set(A))


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

Solution (Python):
print("YNEOS"[int(input())!=len(set(list(map(int, input().split()))))::2])

Solution (Python):
n = int(input())
*a, = 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()))

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

Solution (Python):
N = int(input())
M = input().split()

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N=I()
    A=set(LI())
    print(["NO","YES"][len(A)==N])

if __name__ == '__main__':
    main()

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

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

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

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

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

s = set()

for ai in a:
    s.add(ai)

can = len(s) == n

print("YES" if can else "NO")

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

from collections import Counter

Acnt = Counter(A)
flag = False
for _, cnt in Acnt.items():
    if cnt > 1:
        flag = True

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

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

Solution (Python):
print("YNEOS"[int(input())!=len(set(input().split()))::2])

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

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))

    tmp = set(a)

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

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

Solution (Python):

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

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

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    N = int(input())
    A = [int(a) for a in input().split()]
    A = set(A)
    if len(A) == N: print("YES")
    else: print("NO")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import sys
stdin = sys.stdin
from itertools import accumulate

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
a = set(map(int, input().split()))
if N == len(a): print("YES")
else: print("NO")

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

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

Solution (Python):
def main():
    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]:
            return print("NO")
    print("YES")


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
from collections import Counter

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

ans = Counter(A)
max_value = max(ans.values())

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

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

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  


def solve(N: int, A: "List[int]"):
    if len(set(A))==N:
        print(YES)
    else:
        print(NO)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, A)

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
a_list = [int(e) for e in input().split()]

a_set = set(a_list)

if len(a_list) == len(a_set):
  print("YES")
else:
  print("NO")

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

Solution (Python):
kazu1 = int(input())
kazu2 = list(map(int, input().split()))

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

if has_duplicates(kazu2):
    print("YES")
else:
    print("NO")

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


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

flg = has_duplicates(a)

if not flg:
    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")
    break
else:
  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):
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.sort()
flg=0
for i in range(1,N):
    if(a[i]==a[i-1]):
        flg=1
if flg==1:
    print("NO")
else:
    print("YES")

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

a.sort()
flg=0
if(a[0]==a[1]):
    flg=1
for i in range(1,N-1):
    if(a[i]==a[i-1]):
        flg=1
if flg==1:
    print("NO")
else:
    print("YES")

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


num_2 = len(set(list_1))

if N == num_2:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):

n = int(input())

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



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

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

Solution (Python):
N = input()

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

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

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

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

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

A.sort()


for i in range(N // 2):
    
    
    
    
    if A[i] == A[i+1]:
        print("NO")
        exit()
    elif A[-1-i] == A[-2-i]:
        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 = input()
list = [s for s in input().split()]
set = set(list)

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

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

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

Solution (Python):
N=int(input())
A=input().split()
not_same=1
A.sort()

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

if not_same == N:
    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()))

val = len(set(A))

if N == val:
  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):
print("YNEOS"[int(input())>len(set(input().split()))::2])

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

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

Solution (Python):


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

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

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

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

Solution (Python):
import collections

def distinct(N, A):
  counted = collections.Counter(A)
  max = counted.most_common()[0][1]
  if max >= 2:
    print('NO')
  else:
    print('YES')
    
N = int(input())
A = list(map(int, input().split()))
distinct(N, A)

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

S=set(A)

print("NO" if len(S)!=a else "YES")

Solution (Python):
def main():

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

if __name__ == "__main__":
    main()

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

Solution (Python):
def has_duplicates(seq):
    if len(seq) != len(set(seq)):
        return "NO"
    else:
        return "YES"

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

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 = [i for i in input().split()]

a_set = set(a_list)

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

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

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

b = list(set(a))

if sorted(a) == sorted(b):
  print('YES')
else:
  print('NO')

Solution (Python):

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

new_a_arr = sorted(a_arr)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin


def get_result(data):
    N, A = data[0], data[1]
    return 'YES' if len(set(A)) == N[0] 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)

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

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

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

Solution (Python):



from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n = ii()
    a = li()

    a = sorted(a)
    
    for i in range(1,n):
        if a[i] == a[i-1]:
            print('NO')
            exit()

    print('YES')
            




main()

Solution (Python):
n=int(input())
d=dict()
s=list(map(int,input().split()))
for i in s:
  if i in d:
    d[i]=2
  else:
    d[i]=1
if 2 in d.values():
  print("NO")
else:
  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")
        exit()

print("YES")

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
s = set()
for i in l:
    if (i in s):
        print("NO")
        exit(0)
    s.add(i)
print("YES")

Solution (Python):

from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n = ii()
    a = li()

    a = sorted(a)
    
    for i in range(1,n):
        if a[i] == a[i-1]:
            print('NO')
            exit()
            
    print('YES')
            




main()

Solution (Python):
N = int(input())
*A, = 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()))
A.sort()

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

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

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

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



from math import *
from copy import *
from string import *				
from random import *				
from sys import stdin
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
from collections import defaultdict 

'''

'''

def solve(l):
	n = len(l)
	

N = int(stdin.readline())
l = list(map(int, stdin.readline().rstrip().split()))
d = dict(Counter(l))
if(len(d) == N):
	print("YES")
else:
	print("NO")

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

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

print('YES')

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
dic={}
out=0

for num in a:
    if num in dic.keys():
        out=1
        break
    else:
        dic[num]=1

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

Solution (Python):






import math
import statistics
import numpy as np
import queue

def qsort(seq):
	if len(seq) < 2:
		return seq
	else:
		beg, end = 0, len(seq) - 1
		mid = (beg + end) // 2
		smaller = [c for c in seq if seq[mid] > c]
		equal = [c for c in seq if seq[mid] == c]
		larger = [c for c in seq if seq[mid] < c]
		return (qsort(smaller) + equal + qsort(larger)) 

n = int(input())
a = qsort(list(int(i) for i in input().split()))

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

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())
inputA = input()
listA = inputA.split(' ')
listA.sort()
output = 'YES'
for i in range (len(listA) - 1):
    if listA[i] == listA[i + 1]:
        output = 'NO'
print(output)

Solution (Python):


n = input()
inp = input().split()

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

Solution (Python):
n = input()
n = input().split()
s=set()
f=True
for c in n:
	if c in s:
		print("NO")
		f= False
		break
	s.add(c)
if f:
	print("YES")

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()
    c = set(LI())
    if len(c) == n:
        return 'YES'

    return "NO"


print(main())

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


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


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

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

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

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

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

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()))
a_len = len(a)
a_unique = set(a)
a_unique_len = len(a_unique)

if a_len == a_unique_len :
    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())
a=list(map(int,input().split()))
a.sort()
import sys
for i in range(n-1):
    if a[i]==a[i+1]:
        print('NO')
        sys.exit()
print('YES')

Solution (Python):
N = int(input())
s = {int(x) for x in input().split()}
if N == len(s):
    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):
flag = True
n = int(input())

a = input().split()

a.sort()
start = 0
for i in a:
    for j in a[start-1:start+1:2]:
        if i == j:
            flag = False
            break
    start += 1
    
if flag:
    print('YES')
else:
    print('NO')

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

def merge(l) :
  length = len(l)
  
  if(length <= 1) :
    return 0, l
  
  flag, left = merge(l[0:int(length/2)])
  if(flag == 1) :
    return 1, l
  flag, right = merge(l[int(length/2):length])
  if(flag == 1) :
    return 1, l
  
  total = []
  while(True) :
    if(len(left) == 0) :
      total.extend(right)
      return 0, total
    if(len(right) == 0) :
      total.extend(left)
      return 0, total
    if(left[0] == right[0]) :
      return 1, l
    if(left[0] < right[0]) :
      total.append(left.pop(0))
    else :
      total.append(right.pop(0))
        
a.sort()
for i in range(0, len(a)-1) :
  if(a[i] == a[i+1]) :
    print("NO")
    exit()

print("YES")

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

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

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
s = set()
for a in A:
    if a in s:
        print("NO")
        exit()
    else:
        s.add(a)
print("YES")

Solution (Python):





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

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

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

d = {}
for x in a:
    if d.get(x, 0) == 0:
        d[x] = 1
    else:
        print("NO")
        exit(0)
print("YES")

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

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

Solution (Python):
line1 = input()
line2 = input()
num_list = line2.split(" ")

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

Solution (Python):
input1 = int(input())
input2 = list(input().split())

input2 = set(input2)


if input1 == len(input2):
    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())
input1 = input()
an = input1.split(" ")

an_sorted = sorted(an)
flag = 0
for i in range(len(an_sorted)-1):
    if an_sorted[i] == an_sorted[i+1]:
        flag = 1
if flag == 1:
    print("NO")
else:
    print("YES")

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

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

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

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

if len(list(set(As)))!=len(As):
    print("NO")
else:
    print("YES")

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

num_dic = {}

for ele in lis:
    if ele not in num_dic:
        num_dic[ele] = 1
    else:
        num_dic[ele] += 1
        
if max(num_dic.values()) == 1:
    print("YES")
else:
    print("NO")

Solution (Python):
def has_duplicate(array):
  return len(array) != len(set(array))

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

for num in numbers:
  num = int(num)
if has_duplicate(numbers):
  print("NO")
else:
  print("YES")

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

Solution (Python):
def has_duplicate(array):
  return len(array) != len(set(array))

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

for num in numbers:
  num = int(num)
if has_duplicate(numbers):
  print("NO")
else:
  print("YES")

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

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())
arr=set(map(int,input().split()))
print("YES" if n==len(arr) 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()]

myset=set() 

for a in A:
  if a in myset:
    print('NO')
    exit()
  else:
    myset.add(a)
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 = set(map(int, input().split()))

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

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

convert_str = set(a)

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

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

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

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

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

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

value=True
for i in range(1,len(li)):
  if li[i]==li[i-1]:
    value=False
    break
if value:
  print('YES')
else:
  print('NO')

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

a.sort()
ans='YES'
prev=0
for i in range(n):
    if prev == a[i]:
        ans='NO'
        break
    else:
        prev = a[i]
print(ans)

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

Solution (Python):
n = int(input())
a = [int(x) for x in input().split()]
a = sorted(a)
for i in range(n-1):
    if a[i] == a[i+1]:
        print('NO')
        exit(0)
print('YES')

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

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

numList = list(map(int, input().split()))
numList.sort()

ans = "YES"

for z in range(N-1):
  if numList[z] == numList[z+1]:
    ans = "NO"
    break
    
print(ans)

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

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

input_line = list(input().split())
input_len = len(input_line)
input_set = len(set(input_line))

if input_len == input_set:
    print('YES')
else:
    print('NO')