def composite(d,n,s):

    for a in (2,3,5,7):

        p = False

        if pow(a,d,n) == 1:

            p = True

            continue

        for i in range(s):

            if pow(a, 2**i * d, n) == n-1:

                p = True

                break

        return not p

    return False



def is_prime(n):

    if n==2:

        return True

    elif n%2==0:

        return False

    else:

        d,s = n-1, 0

        while not d%2:

            d,s = d>>1,s+1

        return not composite(d,n,s)

r = []

n = int(eval(input()))

for i in range(n):

  n = int(eval(input()))

  if is_prime(n):

      if n not in r:

          r.append(n)



print((len(r)))
def composite(d,n,s):

    for a in (2,3,5,7):

        p = False

        if pow(a,d,n) == 1:

            continue

        for i in range(s):

            if pow(a, 2**i * d, n) == n-1:

                p = True

                break

        if not p:

            return True

    return False



def is_prime(n):

    if n in (2,3,5,7):

        return True

    elif 0 in (n%2,n%3,n%5,n%7):

        return False

    else:

        d,s = n-1, 0

        while not d%2:

            d,s = d>>1,s+1

        return not composite(d,n,s)

r = []

n = int(eval(input()))

for i in range(n):

  n = int(eval(input()))

  if is_prime(n):

      if n not in r:

          r.append(n)



print((len(r)))
def composite(d, n, s):
    for a in (2, 3, 5, 7):
        p = False
        if pow(a, d, n) == 1:
            p = True
            continue
        for i in range(s):
            if pow(a, 2**i * d, n) == n - 1:
                p = True
                break
        return not p
    return False


def is_prime(n):
    if n == 2:
        return True
    elif n % 2 == 0:
        return False
    else:
        d, s = n - 1, 0
        while not d % 2:
            d, s = d >> 1, s + 1
        return not composite(d, n, s)


r = []
n = int(eval(input()))
for i in range(n):
    n = int(eval(input()))
    if is_prime(n):
        if n not in r:
            r.append(n)
print((len(r)))

def composite(d, n, s):
    for a in (2, 3, 5, 7):
        p = False
        if pow(a, d, n) == 1:
            continue
        for i in range(s):
            if pow(a, 2**i * d, n) == n - 1:
                p = True
                break
        if not p:
            return True
    return False


def is_prime(n):
    if n in (2, 3, 5, 7):
        return True
    elif 0 in (n % 2, n % 3, n % 5, n % 7):
        return False
    else:
        d, s = n - 1, 0
        while not d % 2:
            d, s = d >> 1, s + 1
        return not composite(d, n, s)


r = []
n = int(eval(input()))
for i in range(n):
    n = int(eval(input()))
    if is_prime(n):
        if n not in r:
            r.append(n)
print((len(r)))

-            p = True -        return not p +        if not p: +            return True -    if n == 2: +    if n in (2, 3, 5, 7): -    elif n % 2 == 0: +    elif 0 in (n % 2, n % 3, n % 5, n % 7):