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().split()[0])
a_list = list(map(int, input().split()))
ans = "YES" if len(a_list) == len(set(a_list)) else "NO"

print(ans)

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

B = set(A)

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

Solution (Python):

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

my_set = set()

for item in my_list:
    if item in my_set:
        print('NO')
        exit()
    else:
        my_set.add(item)

print('YES')

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

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

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 = 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()))
l = len(a)
if l == n:
    print("YES")
else:
    print("NO")

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())
li = len(set(map(int,input().split())))
if N == li:
    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):
n = 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(a_i) for a_i in input().split()]

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

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

_a = set(a)

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

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

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

A_dict = dict()
for i in range(N):
    if A[i] in A_dict:
        print("NO")
        exit()
    else:
        A_dict[A[i]] = 1
        
print("YES")

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

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

if has_duplicates(lst)==True:
    print("NO")
else:
    print("YES")

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

l = input().split()
  
l2 = list(set(l))

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

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

Solution (Python):
from collections import Counter
n = int(input())
a = list(map(int,input().split()))
a = Counter(a)
if a.most_common()[0][1] == 1: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()

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

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

s = set(A)

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

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


print('YES' if n==m else 'NO')

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

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

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

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

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

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

Solution (Python):
n = int(input())
a = sorted(list(map(int, input().split())))
ans = "YES"
now = 0
for i in a:
  if i == now:
    ans = "NO"
    break
  now = i
print(ans)

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


if a == b:
    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
flag = 0
for a in C:
    if C[a]>1:
        flag = 1
        break
if flag==0:
    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):
import numpy as np

if __name__ == "__main__":
  _n = int(input())
  _l = [int(i) for i in input().split()]

  check = set()
  for i in _l:
    if i in check:
      print("NO")
      exit(0)
    else:
      check.add(i)
  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())
alist=list(map(int,input().split()))

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

Solution (Python):
import sys
input = sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
from collections import Counter
s=Counter(a)
if n==len(s):
    print("YES")
else:
    print("NO")

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

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

def cond():
    return len(a) == len(b)

if cond():
    print('YES')
else:
    print('NO')

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())
    A = list(map(int, input().split()))

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


main()

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

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

Solution (Python):
import sys


def main():
    n = int(sys.stdin.readline().strip())
    a = [int(s) for s in sys.stdin.readline().strip().split()]

    seen = set()
    is_yes = True
    for ai in a:
        if ai in seen:
            is_yes = False
            break
        seen.add(ai)
    if is_yes:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
A=list(map(int,input().split()))
A=sorted(A)
a=0
for i in range(n-1):
  if A[i]==A[i+1]:
    a=1
if a==0:
  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()))

B = set(A)
la = len(A)
lb = len(B)
if la == lb:
    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())
List=list(map(int,input().split()))
List.sort()
A = 0

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

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

if __name__ == "__main__":
    main()

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

Solution (Python):
N = int(input())
As = list(map(lambda x: int(x), input().split(" ")))
distinct = set(As)

if len(distinct) == len(As):
    print("YES")
else:
    print("NO")

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

arrset = set(arr)

if len(arr) == len(arrset):
    print("YES")
else:
    print("NO")

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

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

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

Solution (Python):
from bisect import bisect_right, bisect_left
from collections import Counter, deque
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import groupby, permutations, combinations, product
from sys import stdin, stderr





def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)





def exgcd(x, y):
    if y == 0:
        return 1, 0
    a, b = exgcd(y, x % y)
    return b, a - (x // y) * b



def lcm(x, y):
    m = gcd(x, y)
    return (x // m) * (y // m)


def main():
    n = int(input())
    a = [int(x) for x in input().split()]
    b = set()
    for x in a:
        b.add(x)
    return "YES" if len(a) == len(b) else "NO"


if __name__ == "__main__":
    print(main())

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

hs = {}
found = False
for i in range(N):
    if A[i] in hs: 
        found = True
        break
    else: hs[A[i]] = True

print('NO' if found else 'YES')

Solution (Python):
n,*l=map(int,open(0).read().split())
print("YES" if len(set(l))==n else "NO")

Solution (Python):

N=int(input())
A=[int(i) for i 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()))
if len(a)==len(set(a)):
    print('YES')
else:
    print('NO')

Solution (Python):
n = int(input())
an = list(map(int, input().split()))
an.sort()
ai = an[0]
for aj in an[1:]:
  if ai == aj:
    print('NO')
    exit()
  ai = aj
print('YES')

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

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


n = ii()
a = li()
aa = set(a)
if len(aa) == len(a):
    print("YES")
else:
    print("NO")

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

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

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

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

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

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    
    
    
    
    
    
    
    
    
    

    N = r_int()
    A = R()
    A.sort()
    temp = -1
    for i in A:
        if temp == i:
            print('NO')
            return
        temp = i
    print('YES')

    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

sortedarr = sorted(arr)

for i in range(n-1):
  if sortedarr[i] == sortedarr[i+1]:
    print("NO")
    break
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")
    quit()
print("YES")

Solution (Python):
import collections

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

c=collections.Counter(a)

ans=True
for i,m in c.items():
    if m>1:
        ans=False
        break
if ans:
    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):
def main():
    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)
    return

if __name__=="__main__":
    main()

Solution (Python):

from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left
INF = float('inf')

N=int(input())
An=list(map(int, input().split()))
def has_duplicates(seq):
    return len(seq) != len(set(seq))

if has_duplicates(An):
    print('NO')
else:
    print('YES')

Solution (Python):
i=int(input())
l=set(map(int,input().split()))

print('YES' if i == len(l) else 'NO')

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

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

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

for i in range(1,N):
  if A[i-1]==A[i]:
    print("NO")
    exit()

print("YES")

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

Solution (Python):
import sys

stdin = sys.stdin

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

n = ni()
a = na()
a.sort()

diff = True
for i in range(n-1):
    if a[i] == a[i+1]:
        diff = False
if diff:
    print("YES")
else:
    print("NO")

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

Solution (Python):
n=int(input())
lst=input().split()
if len(set(lst))==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):
import sys
input = sys.stdin.readline


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

    dic = dict()
    ans = 'YES'

    for s in As:
        if s in dic:
            ans = 'NO'

        dic[s] = 1

    print(ans)


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]

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

l.sort()
pre = l[0]
for i in range(1,N):
    d = l[i]
    if pre==d:
        print('NO')
        exit()
    pre = d
print('YES')

Solution (Python):

import collections
N = int(input())
lst = list(map(int, input().split()))
c = dict(collections.Counter(lst))
ans = 'YES'
for i in c.values():
    if (i != 1):
        ans = 'NO'
        break
print(ans)

Solution (Python):
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 999999999
R = 10**9 + 7

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

n = inn()
h = {}
a = inl()
for i in range(n):
    if a[i] in h:
        print('NO')
        exit()
    h[a[i]] = 1
print('YES')

Solution (Python):
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda x: [ni() for _ in range(x)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: stdin.readline().split()

from collections import defaultdict

n = ni()
a = na()
d = defaultdict(int)
flag = True
for i in range(n):
    if d[a[i]] > 0:
        flag = False
    d[a[i]] += 1

if flag:
    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()))
B=set(A)
if N==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):
import numpy as np

N = int(input())
A = np.array(input().split(), dtype=int)

if len(A) == len(np.unique(A)):
  print('YES')
else:
  print('NO')

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

l=set(a)

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

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