Problem:
Score : 400 points

Problem Statement

Given is a number sequence A of length N.

Find the number of integers i \left(1 \leq i \leq N\right) with the following property:

For every integer j \left(1 \leq j \leq N\right) such that i \neq j , A_j does not divide A_i.

Constraints

All values in input are integers.

1 \leq N \leq 2 \times 10^5

1 \leq A_i \leq 10^6

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \cdots A_N

Output

Print the answer.

Sample Input 1

5
24 11 8 3 16

Sample Output 1

3

The integers with the property are 2, 3, and 4.

Sample Input 2

4
5 5 5 5

Sample Output 2

0

Note that there can be multiple equal numbers.

Sample Input 3

10
33 18 45 28 8 19 89 86 2 4

Sample Output 3

5

Solution in C# (Mono-csc 3.5.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
public class GFG
{
    class Pair
    {
        public int Num;
        public int diff;
    }
    public static void Main()
    {

        var n = int.Parse(Console.ReadLine());

        var arr = Console.ReadLine().Split(' ').Select(x => int.Parse(x)).ToArray();
        int count = 0;
        bool[] arr1 = new bool[1000001];
        Array.Sort(arr);

        List<int> lst = new List<int>();

        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n && arr1[arr[j]] == false; j++)
            {
                if (i != j)
                {
                    if (arr[j] % arr[i] == 0)
                    {
                        arr1[arr[j]] = true;
                    }
                }
            }
        }
        int countTrue = 0;
        for (int i = 0; i < 1000001; i++)
        {
            if (arr1[i])
                countTrue++;
        }
        Console.Write(n - countTrue);


    }
}