def solution(a)
 n = a.size
 divisors = a.sort
 non_divisors = [nil]*2*n

 for i in 0...n do
   element = divisors[i]
   next if non_divisors[divisors[i]] != nil
   j=0
   while j < n do
     if element < i*i
       non_divisors_count = non_divisors-count + n - j
       break
     else
       if element%divisors[i] != 0
         non_divisors_count += 1
       end
     end
     j+=1
   end
   non_divisors[divisors[i]] = non_divisors_count
 end

 result = []
 for i in 0...n do
   result << non_divisors[a[i]]
 end

 result
end