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

Solution (Python):
import sys
n=int(input())
a=[s for s in 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):
import collections

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

cs = collections.Counter(A)
mcs = cs.most_common()
cnt = mcs[0][1]
if cnt == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
d = Counter(a)
k = d.most_common(1)[0][1]
if k>=2:
  print('NO')
else:
  print('YES')

Solution (Python):
from collections import Counter
input()
cnt=Counter(map(int,input().split()))

for v in cnt.values():
    if v>1:
        print('NO')
        break
else:
    print('YES')

Solution (Python):
import sys

N = int(sys.stdin.readline().rstrip())
A = [int(x) for x in sys.stdin.readline().rstrip().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())

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

Solution (Python):
print("YES") if int(input()) == len(list(set(input().split(" ")))) 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 = sorted(a)

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

Solution (Python):
import sys
N = int(next(sys.stdin))
A = tuple(map(int, next(sys.stdin).strip().split()))
a = frozenset(A)

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

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

Solution (Python):
n=int(input())
a=[int(x) for x in input().split()]


ans={}
flag=0
for i in a:
  if i not in ans:
    ans[i]=1
  else:
    flag=1
    break

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

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

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

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

Solution (Python):
input()
A = 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()))
if n ==len(set(a)):
    print("YES")
else:
    print("NO")

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

Solution (Python):
import collections

N = int(input())
A = map(int, input().split())
answer = 'YES'
for v in collections.Counter(A).values():
    if v != 1:
        answer = 'NO'
        break
print(answer)

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

Solution (Python):
N=int(input())
from collections import Counter
if max(Counter([int(x) for x in input().split()]).values())==1:
  print("YES")
else:
  print("NO")

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

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

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

if '__main__' == __name__:
    resolve()

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

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

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


S={}
ans="YES"
for p in P:
    if p in S:
        ans = "NO"
        break
    else:
        S[p]=1

print(ans)

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

print(['NO','YES'][len(A)==len(set(A))])

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

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

newA = list(set(A))

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

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

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 = set(input().split())

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "YES"  
NO = "NO"  


def list_uniq_count(l):
    return len(set(l))


def solve(N: int, A: "List[int]"):
    return [NO, YES][list_uniq_count(A) == len(A)]


def main():

    sys.setrecursionlimit(10 ** 6)

    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)]  
    print(f'{solve(N, A)}')


if __name__ == '__main__':
    main()

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(input().split())

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

Solution (Python):
nn = int(input())
aa = list(map(int,input().split()))

aa.sort()


flag = 0

for i in range(nn-1):
    if (aa[i] == aa[i+1]) and (flag == 0):
        print('NO')
        flag = 1

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

Solution (Python):
import sys


def main():
    input = sys.stdin.buffer.readline
    n = int(input())
    a = list(map(int, input().split()))
    print("YES" if n == len(set(a)) else "NO")


if __name__ == "__main__":
    main()

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

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

    set_A = set([])
    for num in A:
        if num in set_A:
            print('NO')
            return
        set_A.add(num)
    print('YES')

if __name__ == "__main__":
    solve()

Solution (Python):
import math
from math import gcd
INF = float("inf")

import sys
input=sys.stdin.readline
import itertools
from collections import Counter

def main():
    n = int(input())
    l = list(map(int, input().split()))
    l = Counter(l)
    if all(i == 1 for i in l.values()):
        print("YES")
    else:
        print("NO")


if __name__=="__main__":
    main()

Solution (Python):
import math
from math import gcd
INF = float("inf")

import sys
input=sys.stdin.readline
import itertools
from collections import Counter

def main():
    n = int(input())
    l = list(map(int, input().split()))
    len_l = len(l)
    len_set_l = len(set(l))
    if len_l != len_set_l:
        print("NO")
    else:
        print("YES")



if __name__=="__main__":
    main()

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

Solution (Python):

from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify

import itertools, bisect
import math, fractions
import sys, copy

def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def S(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]

alphabets = "abcdefghijklmnopqrstuvwxyz"
ALPHABETS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

sys.setrecursionlimit(1000000)
dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
MOD = 1000000007

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

if __name__ == '__main__':
    main()

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

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

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

l.sort()

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

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


solve()

Solution (Python):
from typing import List


def main():
    n = int(input())
    nums = input().split(' ')
    r = don(n, nums)
    if r:
        print('YES')
    else:
        print('NO')


def don(n: int, nums: List[str]) -> bool:
    s = set()
    result = True

    for i in range(n):
        num = nums[i]
        if num in s:
            result = False
            break
        s.add(num)

    return result


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):
def solve():
    n = int(input())
    s = list(map(int, input().split()))
    t = set(s)
    print("YES" if len(s) == len(t) else "NO")


solve()

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A.sort()
Ans = "YES"
List = []
before_n = 0
for e in A:
    if e == before_n:
        Ans = "NO"
        break
    else:
        before_n=e
print(Ans)

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

Solution (Python):
def main():
    """"ここに今までのコード"""
    N = int(input())
    num_list = list(map(int, input().split()))
    num_list.sort()
    distinctFlg = False

    for i in range(N - 1):
        if num_list[i] == num_list[i+1]:
            distinctFlg = True
            break
    
    if distinctFlg:
        print("NO")
    else:
        print("YES")

if __name__ == '__main__':
    main()

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
a = inpl()

ans = 'YES'
d = defaultdict(int)
for i in a:
    if d[i] == 1:
        ans = 'NO'
        break
    d[i] = 1

print(ans)

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

from collections import Counter
b = Counter(a)

for i in b.values():
    if i>1:
        print('NO')
        break
else:
    print('YES')

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

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

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

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

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

cnt = dict()
for i in range(N):
    cnt[A[i]] = cnt.get(A[i], 0) + 1

if max(cnt.values()) > 1:
    print('NO')
else:
    print('YES')

Solution (Python):

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


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

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

ac = Counter(a)
if len(ac) == n:
    print("YES")
else:
    print("NO")

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

Solution (Python):
def main():
    n = int(input())
    nums = input().split(' ')
    s = set()
    result = 'YES'

    for i in range(n):
        num = nums[i]
        if num in s:
            result = 'NO'
            break
        s.add(num)

    print(result)


if __name__ == '__main__':
    main()

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

result = distinct_or_not()
print(result)

Solution (Python):
input()
(*a,) = map(int, input().split())
print(["NO", "YES"][len(a) == len(set(a))])

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

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

if(len(l1)==len(set(l1))):
    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,*a = map(int,open(0).read().split())
a.sort()
flag = True
for i in range(1,N):
  if a[i]==a[i-1]:
    print('NO')
    flag=False
    break
if flag ==True:
  print('YES')

Solution (Python):
N,*a = map(int,open(0).read().split())
a.sort()
flag = True
for i in range(1,N):
  if a[i]==a[i-1]:
    print('NO')
    flag=False
    break
if flag ==True:
  print('YES')

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

def main(n,a):
    a.sort()
    for i in range(n-1):
        if a[i]==a[i+1]:
            return 'NO'
    return 'YES'

if __name__=='__main__':
    n,a=readinput()
    ans=main(n,a)
    print(ans)

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


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    N = read_int()
    A = read_ints()
    if len(A) == len(set(A)):
        return 'YES'
    return 'NO'


if __name__ == '__main__':
    print(solve())

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
uni_A = list(set(A))
if len(uni_A) == N:
    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 = input()
an = [int(num) for num in input().split()]
an_unique = list(set(an))

if len(an) == len(an_unique):
  print("YES")
else :
  print("NO")

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import itertools

n = int(stdin.readline().rstrip())
a = [int(x) for x in stdin.readline().rstrip().split()]

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

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

print("YES" if len(set(nums)) == len(nums) else "NO")

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

s = set()
for i in range(len(a)):
    s.add(a[i])

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

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

Solution (Python):
n=int(input())
li=sorted(list(map(int,input().split())))
bef=-1

for i in li:
  if bef==i:
    print("NO")
    break
  bef=i
else:
  print("YES")

Solution (Python):
from collections import Counter
N = map(int, input().split())
A = list(map(int, input().split()))
dic=Counter(A)
for val in dic.values():
    if val > 1:
        print("NO")
        exit()

print("YES")

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

li = collections.Counter(a)

li2 = [i for i in li.values()]

if max(li2)==1:
    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):
import sys
input = sys.stdin.readline
n=int(input())
L=list(map(int,input().split()))
if len(set(L))!=n:
    print('NO')
else:
    print('YES')

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

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


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

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


if(__name__ == '__main__'):
  main()

Solution (Python):

import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    N = II()
    S = LI()

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


main()

Solution (Python):
n=int(input());print('NYOE S'[len(set(map(int,input().split())))==n::2])

Solution (Python):
N=int(input())
L=list(map(int,input().split()))
L=sorted(L)
X=-1
T=True
for i in L:
  if i!=X:
    X=i
  else:
    T=False
if T==True:
  print("YES")
else:
  print("NO")

Solution (Python):
def judge(n,a):
    table = {}
    for i in range(n):
        if a[i] in table.keys():
            print('NO')
            return
        else:
            table[a[i]] = 1
    print('YES')
    return
    
n = int(input())
a = list(map(int,input().split()))

judge(n,a)

Solution (Python):



import numpy as np

N = int(input())








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

print('YNEOS'[len(A) != len(np.unique(A))::2])

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

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

Solution (Python):
from collections import Counter as Ct
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))

def do():
    n=INT()
    a=LIST()
    a=set(a)
    if n==len(a):
        print('YES')
    else:
        print('NO')
if __name__=='__main__':
    do()

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

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re












import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

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

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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



N = I()
A = LI()

def main():
    judge=False
    if len(set(A))==N:
        judge=True
    if judge:
        return 'YES'
    else:
        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):
N = int(input())
A = list(map(int,input().split()))
C = {}
for i in range(N):
    a = A[i]
    if a not in C:
        C[a] = 0
    C[a] += 1
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('NO')
else:
    print('YES')

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

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

cnt = {}

for a_i in a:
    try:
        cnt[ a_i ]
        print( "NO" )
        break
    except KeyError:
        cnt[ a_i ] = 1
else:
    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()))

a_1 = int(len(a))
a_2 = int(len(set(a)))
if a_1 == a_2:
  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):

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

M = len(set(A))

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

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

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

Solution (Python):
n = int(input())
tmp = input().split()
a = []
for i in range(n):
  a.append(int(tmp[i]))

a.sort()

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

print("YES")

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

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

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

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

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

Solution (Python):
N = int(input())
a = list(map(int,input().split()))
dic = {}
for nums in a:
  if nums in dic:
    dic[nums] += 1
  else:
    dic[nums] = 1
ma = 0
for keys in dic:
  ma = max(ma,dic[keys])
if ma == 1:
  print("YES")
else:
  print("NO")

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

b = [-1] + a

l = []
for i in range(n):
  l.append(a[i] - b[i])
  
if l.count(0) == 0:
  print('YES')
else:
  print('NO')

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

A.sort()

for i in range(len(A)):
    if i == 0:
        continue
    if A[i-1] == A[i]:
        print('NO')
        exit()
print('YES')

Solution (Python):

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

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

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 = list(set(A))

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

else:
    print("NO")

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

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

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

Solution (Python):
from collections import defaultdict
dic = defaultdict(int)

N = int(input())
for a in list(map(int, input().split())):
  dic[a] += 1
  if dic[a] >= 2:
    print('NO')
    exit()
print('YES')

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

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

Solution (Python):
from collections import Counter
n=int(input())
a=list(map(int, input().split()))

cnt=Counter(a)

for k in cnt.values():
    if k != 1:
        print('NO')
        break
else:
    print('YES')

Solution (Python):
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
cnt = Counter(A)
print('YES' if len(cnt) == N 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):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

n = k()
a = l()

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

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

dic = {}

for i in A:
    if i not in dic:
        dic[i] = 0
    dic[i] += 1
    
print("YES" if max(dic.values()) == 1 else "NO")

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
di = {}
for i in range(N):
    if A[i] in di:
        di[A[i]] += 1
    else:
        di[A[i]] = 1
if max(di.values()) != 1:
    print("NO")
else:
    print("YES")

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

Solution (Python):
from collections import Counter

N,*A = map(int, open(0).read().split())
ac = Counter(A)
if len(ac) == N:
    print('YES')
else:
    print('NO')

Solution (Python):
n = 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())
A=list(map(int,input().split()))
print(['NO','YES'][int(len(set(A))==len(A))])

Solution (Python):
n = int(input())
arr = input().split()
print("YES" if len(arr) == len(set(arr)) else "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 = set()

for a in A:
    if a in B:
        print('NO')
        exit()
    else:
        B.add(a)
print('YES')

Solution (Python):
n,*a=map(int,open(0).read().split())
print('NYOE S'[len(set(a))==n::2])

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

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

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

Solution (Python):
N = int(input())
A = [int(x) for x 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()))

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

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

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

print(ans)