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# (.NET Core 3.1.201) (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Math;

namespace D_ABC170
{
    class MainClass
    {

        static int[] s;
        static long[] a;

        public static void Main(string[] args)
        {
            s = Array.ConvertAll(ReadLine().Split().ToArray(), int.Parse);
            a = Array.ConvertAll(ReadLine().Split().ToArray(), long.Parse);

            var sl = a.ToList();
            sl.Sort((long x, long y) => y.CompareTo(x));
            int n = s[0];

            int ans = 0;

            for (int i = 0; i < n; i++)
            {
                var dived = sl[i];
                var isok = true;
                if (i != 0 && sl[i] == sl[i - 1])
                {
                    isok = false;
                }
                else
                {
                    for (int j = n - 1; j > i; j--)
                    {
                        // if (sl[j] > dived / 2)
                        // {
                        //     break;
                        // }
                        if (dived % sl[j] == 0)
                        {
                            isok = false;
                            break;
                        }
                    }
                }
                if (isok)
                {
                    ans++;

                }
            }
            WriteLine(ans);


        }
    }
}