#include <bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
int n, maxn, a[1000001], cishu[1000001], b[1000001], ans, cnt, tot;
signed main()
{
    freopen("bricks.in", "r", stdin);
    freopen("bricks.out", "w", stdout);
    n = read();
    for (int i = 1; i <= n; i++)
    {
        a[i] = read();
        cishu[a[i]]++;
        maxn = max(maxn, a[i]);
    }
    for (int i = 1; i <= maxn; i++)
    {
        cishu[i] += cishu[i - 1];
    }
    for (int i = 1; i <= maxn; i++)
    {
        tot = maxn / i;
        for (int j = 1; j <= tot; j++)
        {
            b[j] = cishu[min(i * (j + 1) - 1, maxn)] - cishu[i * j - 1];
        }
        cnt = 0;
        for (int j = 1; j <= tot; j++)
        {
            cnt += (b[j] & 1);
        }
        if (cnt == 1)
        {
            if (b[1] & 1)
                ans += b[1];
        }
        if (cnt == 2)
        {
            for (int j = 2; j <= tot; j++)
            {
                if ((b[j] & 1) && (b[j - 1] & 1))
                {
                    ans += b[j];
                }
            }
        }
    }
    printf("%lld", ans);
    return 0;
}