# Arup Guha
# 12/3/2023
# Solution to 2023 UCF HS Online D1 Problem: Truffula Bees
# Takes 1.33 seconds on the slowest test case on my computer.
# I think that should be good enough. Main code is 10,000,000 steps

# Precomp
sq = []
for i in range(100,0,-1):
    sq.append(i*i)
    
# Get input
n = int(input())
nums = [int(x) for x in input().split()]

# Frequency array of groups.
left = []
for i in range(10001):
    left.append(0)

# Put each item into a group.
for x in nums:

    for i in range(len(sq)):
        if x%sq[i] == 0:
            left[x//sq[i]] += 1
            break

# Add up all non-zero entries.
res = 0
for i in range(len(left)):
    if left[i] > 0:
        res += 1

# Ta da!
print(res)