#!/bin/python3

import sys
from collections import Counter

def largest_prime_factor(n):
    i = 2
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
    return n


def longestSequence(a):
    score = 0
    cnt = Counter(a)
    while len(cnt) > 0:
        try:
            score += cnt.pop(1)
        except KeyError:
            pass
        if (len(cnt) > 0):
            el = max(cnt)
            occ = cnt.pop(el)
            prime = int(largest_prime_factor(el))
            to_add = Counter([el / prime] * prime * occ)
            score += occ
            cnt += to_add
    return score


if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)